/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:52:02,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:52:02,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:52:02,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:52:02,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:52:02,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:52:02,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:52:02,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:52:02,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:52:02,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:52:02,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:52:02,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:52:02,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:52:02,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:52:02,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:52:02,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:52:02,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:52:02,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:52:02,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:52:02,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:52:02,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:52:02,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:52:02,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:52:02,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:52:02,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:52:02,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:52:02,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:52:02,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:52:02,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:52:02,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:52:02,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:52:02,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:52:02,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:52:02,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:52:02,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:52:02,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:52:02,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:52:02,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:52:02,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:52:02,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:52:02,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:52:02,652 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-05 22:52:02,691 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:52:02,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:52:02,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:52:02,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:52:02,694 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:52:02,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:52:02,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:52:02,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:52:02,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:52:02,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:52:02,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:52:02,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:52:02,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:52:02,697 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:52:02,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:52:02,698 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:52:02,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:52:02,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:52:02,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:52:02,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:52:02,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:52:02,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:52:02,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:52:02,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:52:02,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:52:02,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:52:02,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:52:02,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:52:02,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:52:02,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:52:02,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:52:03,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:52:03,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:52:03,009 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:52:03,010 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:52:03,011 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-05 22:52:03,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdd5286/b5ee70d458694ae1be49dea1acd4f86b/FLAG05b5ea7b6 [2020-10-05 22:52:03,742 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:52:03,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-05 22:52:03,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdd5286/b5ee70d458694ae1be49dea1acd4f86b/FLAG05b5ea7b6 [2020-10-05 22:52:03,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afdd5286/b5ee70d458694ae1be49dea1acd4f86b [2020-10-05 22:52:03,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:52:03,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:52:03,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:52:03,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:52:03,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:52:03,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:52:03" (1/1) ... [2020-10-05 22:52:03,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46613757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:03, skipping insertion in model container [2020-10-05 22:52:03,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:52:03" (1/1) ... [2020-10-05 22:52:03,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:52:04,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:52:04,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:52:04,553 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:52:04,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:52:04,685 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:52:04,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04 WrapperNode [2020-10-05 22:52:04,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:52:04,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:52:04,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:52:04,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:52:04,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:52:04,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:52:04,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:52:04,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:52:04,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (1/1) ... [2020-10-05 22:52:04,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:52:04,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:52:04,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:52:04,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:52:04,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (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-05 22:52:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:52:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:52:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:52:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:52:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:52:04,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:52:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:52:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:52:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:52:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:52:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:52:04,888 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:52:06,893 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:52:06,894 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:52:06,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:52:06 BoogieIcfgContainer [2020-10-05 22:52:06,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:52:06,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:52:06,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:52:06,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:52:06,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:52:03" (1/3) ... [2020-10-05 22:52:06,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8233457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:52:06, skipping insertion in model container [2020-10-05 22:52:06,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:52:04" (2/3) ... [2020-10-05 22:52:06,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8233457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:52:06, skipping insertion in model container [2020-10-05 22:52:06,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:52:06" (3/3) ... [2020-10-05 22:52:06,906 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-05 22:52:06,916 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:52:06,917 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:52:06,925 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:52:06,927 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:52:06,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,960 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,961 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,961 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,961 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:52:06,995 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 22:52:07,016 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:52:07,017 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:52:07,017 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:52:07,017 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:52:07,017 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:52:07,017 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:52:07,017 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:52:07,018 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:52:07,033 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-05 22:52:07,035 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-05 22:52:07,076 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-05 22:52:07,076 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:52:07,081 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 22:52:07,084 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-05 22:52:07,102 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-05 22:52:07,103 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:52:07,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 22:52:07,105 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 888 [2020-10-05 22:52:07,106 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:52:07,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:52:07,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:07,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:07,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,477 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-05 22:52:07,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,479 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-05 22:52:07,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:07,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,690 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-05 22:52:07,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,692 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-05 22:52:07,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:52:07,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:07,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-05 22:52:07,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:07,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:07,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:07,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:07,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,910 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-05 22:52:07,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,913 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-05 22:52:07,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:07,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:07,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:07,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:52:07,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:07,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-05 22:52:08,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:08,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:08,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:08,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:08,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:52:08,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:52:08,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:08,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:08,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:52:08,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:08,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,576 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:52:08,682 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 22:52:08,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:52:08,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:08,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:08,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:08,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:52:08,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:08,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:09,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:09,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:09,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:09,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:09,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:09,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:09,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:09,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:09,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:09,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:09,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:09,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:09,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:52:09,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:09,023 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-05 22:52:09,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:09,034 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-05 22:52:09,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:10,675 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-05 22:52:10,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 22:52:10,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:10,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 22:52:10,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:11,788 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-05 22:52:11,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:11,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:11,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:11,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:11,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:11,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:11,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:11,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:11,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:11,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:11,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:12,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:12,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:12,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:12,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:12,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:12,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:12,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:12,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:12,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:13,429 WARN L193 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2020-10-05 22:52:13,739 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-05 22:52:14,334 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-05 22:52:14,616 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-05 22:52:14,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:14,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:14,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:14,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:14,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:14,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:52:14,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:14,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:14,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:14,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:14,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:14,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:14,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:14,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:15,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:15,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:15,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:15,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:15,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:15,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:52:15,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-05 22:52:15,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:15,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-05 22:52:15,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-05 22:52:15,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-05 22:52:15,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-05 22:52:15,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,211 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-05 22:52:15,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,212 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-05 22:52:15,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-05 22:52:15,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:52:15,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:52:15,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-05 22:52:15,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,328 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-05 22:52:15,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:52:15,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-05 22:52:15,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:52:15,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-05 22:52:15,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:52:15,690 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-05 22:52:16,043 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-05 22:52:16,549 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 22:52:16,653 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-05 22:52:16,659 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2260 [2020-10-05 22:52:16,659 INFO L214 etLargeBlockEncoding]: Total number of compositions: 65 [2020-10-05 22:52:16,663 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-05 22:52:16,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-05 22:52:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-05 22:52:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 22:52:16,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:16,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 22:52:16,691 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash 860640783, now seen corresponding path program 1 times [2020-10-05 22:52:16,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:16,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301094718] [2020-10-05 22:52:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:16,979 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-05 22:52:16,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301094718] [2020-10-05 22:52:16,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:16,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:52:16,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091586559] [2020-10-05 22:52:16,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:52:16,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:52:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:52:16,998 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-05 22:52:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,093 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-05 22:52:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:52:17,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 22:52:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,115 INFO L225 Difference]: With dead ends: 137 [2020-10-05 22:52:17,115 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 22:52:17,117 INFO L675 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-05 22:52:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 22:52:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-05 22:52:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-05 22:52:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-05 22:52:17,181 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-05 22:52:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,181 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-05 22:52:17,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:52:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-05 22:52:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 22:52:17,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:52:17,183 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1852838512, now seen corresponding path program 1 times [2020-10-05 22:52:17,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130726300] [2020-10-05 22:52:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:17,296 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-05 22:52:17,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130726300] [2020-10-05 22:52:17,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:17,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:52:17,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832393436] [2020-10-05 22:52:17,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:52:17,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:17,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:52:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:52:17,299 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-05 22:52:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,316 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-05 22:52:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:52:17,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 22:52:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,319 INFO L225 Difference]: With dead ends: 110 [2020-10-05 22:52:17,319 INFO L226 Difference]: Without dead ends: 110 [2020-10-05 22:52:17,320 INFO L675 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-05 22:52:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-05 22:52:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-05 22:52:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-05 22:52:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-05 22:52:17,332 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-05 22:52:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,333 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-05 22:52:17,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:52:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-05 22:52:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 22:52:17,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:52:17,334 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1603419562, now seen corresponding path program 1 times [2020-10-05 22:52:17,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583142455] [2020-10-05 22:52:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:17,494 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-05 22:52:17,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583142455] [2020-10-05 22:52:17,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:17,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:52:17,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246145664] [2020-10-05 22:52:17,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:52:17,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:52:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:52:17,496 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-05 22:52:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,537 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-05 22:52:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:52:17,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-05 22:52:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,542 INFO L225 Difference]: With dead ends: 109 [2020-10-05 22:52:17,543 INFO L226 Difference]: Without dead ends: 109 [2020-10-05 22:52:17,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:52:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-05 22:52:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-05 22:52:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-05 22:52:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-05 22:52:17,554 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-05 22:52:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,557 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-05 22:52:17,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:52:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-05 22:52:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:52:17,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:52:17,559 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1832994573, now seen corresponding path program 1 times [2020-10-05 22:52:17,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012411067] [2020-10-05 22:52:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:17,632 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-05 22:52:17,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012411067] [2020-10-05 22:52:17,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:17,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:52:17,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527473686] [2020-10-05 22:52:17,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:52:17,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:52:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:52:17,634 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 3 states. [2020-10-05 22:52:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,648 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-05 22:52:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:52:17,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 22:52:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,650 INFO L225 Difference]: With dead ends: 154 [2020-10-05 22:52:17,651 INFO L226 Difference]: Without dead ends: 118 [2020-10-05 22:52:17,651 INFO L675 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-05 22:52:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-05 22:52:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-05 22:52:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-05 22:52:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-05 22:52:17,660 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-05 22:52:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,660 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-05 22:52:17,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:52:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-05 22:52:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:52:17,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:52:17,662 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1833046095, now seen corresponding path program 1 times [2020-10-05 22:52:17,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929253647] [2020-10-05 22:52:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:17,803 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-05 22:52:17,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929253647] [2020-10-05 22:52:17,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:17,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:52:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413392042] [2020-10-05 22:52:17,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:52:17,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:52:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:17,805 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-05 22:52:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,843 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-05 22:52:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:52:17,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 22:52:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,846 INFO L225 Difference]: With dead ends: 104 [2020-10-05 22:52:17,846 INFO L226 Difference]: Without dead ends: 104 [2020-10-05 22:52:17,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-05 22:52:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-05 22:52:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-05 22:52:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-05 22:52:17,854 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-05 22:52:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,854 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-05 22:52:17,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:52:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-05 22:52:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:52:17,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:52:17,856 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1833599972, now seen corresponding path program 1 times [2020-10-05 22:52:17,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120095620] [2020-10-05 22:52:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:17,915 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-05 22:52:17,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120095620] [2020-10-05 22:52:17,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:17,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:52:17,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846924129] [2020-10-05 22:52:17,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:52:17,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:52:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:52:17,918 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 4 states. [2020-10-05 22:52:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:17,966 INFO L93 Difference]: Finished difference Result 105 states and 222 transitions. [2020-10-05 22:52:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:52:17,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-05 22:52:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:17,970 INFO L225 Difference]: With dead ends: 105 [2020-10-05 22:52:17,971 INFO L226 Difference]: Without dead ends: 105 [2020-10-05 22:52:17,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:52:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-05 22:52:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-05 22:52:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-05 22:52:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 222 transitions. [2020-10-05 22:52:17,979 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 222 transitions. Word has length 9 [2020-10-05 22:52:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:17,980 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 222 transitions. [2020-10-05 22:52:17,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:52:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 222 transitions. [2020-10-05 22:52:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:52:17,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:17,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:17,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:52:17,981 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1832301692, now seen corresponding path program 2 times [2020-10-05 22:52:17,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:17,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285741341] [2020-10-05 22:52:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:18,065 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-05 22:52:18,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285741341] [2020-10-05 22:52:18,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:18,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:52:18,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028727240] [2020-10-05 22:52:18,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:52:18,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:52:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:18,067 INFO L87 Difference]: Start difference. First operand 105 states and 222 transitions. Second operand 5 states. [2020-10-05 22:52:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:18,133 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-05 22:52:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:52:18,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 22:52:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:18,137 INFO L225 Difference]: With dead ends: 102 [2020-10-05 22:52:18,137 INFO L226 Difference]: Without dead ends: 102 [2020-10-05 22:52:18,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-05 22:52:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-05 22:52:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-05 22:52:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-05 22:52:18,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-05 22:52:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:18,146 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-05 22:52:18,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:52:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-05 22:52:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:52:18,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:18,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:18,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:52:18,149 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 989852939, now seen corresponding path program 1 times [2020-10-05 22:52:18,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:18,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488351936] [2020-10-05 22:52:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:18,255 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-05 22:52:18,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488351936] [2020-10-05 22:52:18,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:18,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:52:18,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781709098] [2020-10-05 22:52:18,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:52:18,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:52:18,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:18,258 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 5 states. [2020-10-05 22:52:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:18,357 INFO L93 Difference]: Finished difference Result 112 states and 233 transitions. [2020-10-05 22:52:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:52:18,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-05 22:52:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:18,359 INFO L225 Difference]: With dead ends: 112 [2020-10-05 22:52:18,359 INFO L226 Difference]: Without dead ends: 112 [2020-10-05 22:52:18,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:52:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-05 22:52:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-10-05 22:52:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-05 22:52:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 220 transitions. [2020-10-05 22:52:18,365 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 220 transitions. Word has length 10 [2020-10-05 22:52:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:18,365 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 220 transitions. [2020-10-05 22:52:18,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:52:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 220 transitions. [2020-10-05 22:52:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:52:18,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:18,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:18,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:52:18,367 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash 988554659, now seen corresponding path program 2 times [2020-10-05 22:52:18,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:18,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602925232] [2020-10-05 22:52:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:52:18,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602925232] [2020-10-05 22:52:18,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:18,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:52:18,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5997674] [2020-10-05 22:52:18,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:52:18,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:18,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:52:18,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,469 INFO L87 Difference]: Start difference. First operand 106 states and 220 transitions. Second operand 6 states. [2020-10-05 22:52:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:18,543 INFO L93 Difference]: Finished difference Result 118 states and 241 transitions. [2020-10-05 22:52:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:52:18,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 22:52:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:18,545 INFO L225 Difference]: With dead ends: 118 [2020-10-05 22:52:18,545 INFO L226 Difference]: Without dead ends: 118 [2020-10-05 22:52:18,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-05 22:52:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2020-10-05 22:52:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-05 22:52:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 231 transitions. [2020-10-05 22:52:18,551 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 231 transitions. Word has length 10 [2020-10-05 22:52:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:18,552 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 231 transitions. [2020-10-05 22:52:18,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:52:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 231 transitions. [2020-10-05 22:52:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:52:18,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:18,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:18,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:52:18,553 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash 966759179, now seen corresponding path program 3 times [2020-10-05 22:52:18,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:18,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591073027] [2020-10-05 22:52:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:18,668 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-05 22:52:18,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591073027] [2020-10-05 22:52:18,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:18,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:52:18,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262110354] [2020-10-05 22:52:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:52:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:52:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,671 INFO L87 Difference]: Start difference. First operand 111 states and 231 transitions. Second operand 6 states. [2020-10-05 22:52:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:18,751 INFO L93 Difference]: Finished difference Result 113 states and 233 transitions. [2020-10-05 22:52:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:52:18,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 22:52:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:18,753 INFO L225 Difference]: With dead ends: 113 [2020-10-05 22:52:18,753 INFO L226 Difference]: Without dead ends: 113 [2020-10-05 22:52:18,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-05 22:52:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2020-10-05 22:52:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-05 22:52:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 227 transitions. [2020-10-05 22:52:18,758 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 227 transitions. Word has length 10 [2020-10-05 22:52:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:18,758 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 227 transitions. [2020-10-05 22:52:18,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:52:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 227 transitions. [2020-10-05 22:52:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:52:18,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:18,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:18,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:52:18,760 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 966777779, now seen corresponding path program 4 times [2020-10-05 22:52:18,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:18,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691938690] [2020-10-05 22:52:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:18,879 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-05 22:52:18,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691938690] [2020-10-05 22:52:18,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:18,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:52:18,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739626023] [2020-10-05 22:52:18,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:52:18,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:52:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:18,882 INFO L87 Difference]: Start difference. First operand 109 states and 227 transitions. Second operand 6 states. [2020-10-05 22:52:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:19,023 INFO L93 Difference]: Finished difference Result 113 states and 229 transitions. [2020-10-05 22:52:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:52:19,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 22:52:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:19,025 INFO L225 Difference]: With dead ends: 113 [2020-10-05 22:52:19,025 INFO L226 Difference]: Without dead ends: 97 [2020-10-05 22:52:19,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:52:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-05 22:52:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2020-10-05 22:52:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-05 22:52:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 195 transitions. [2020-10-05 22:52:19,029 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 195 transitions. Word has length 10 [2020-10-05 22:52:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:19,029 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 195 transitions. [2020-10-05 22:52:19,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:52:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 195 transitions. [2020-10-05 22:52:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:52:19,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:19,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:19,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:52:19,030 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 569608686, now seen corresponding path program 1 times [2020-10-05 22:52:19,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:19,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620439281] [2020-10-05 22:52:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:19,123 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-05 22:52:19,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620439281] [2020-10-05 22:52:19,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:19,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:52:19,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825372904] [2020-10-05 22:52:19,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:52:19,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:52:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:19,126 INFO L87 Difference]: Start difference. First operand 95 states and 195 transitions. Second operand 5 states. [2020-10-05 22:52:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:19,193 INFO L93 Difference]: Finished difference Result 114 states and 217 transitions. [2020-10-05 22:52:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:52:19,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 22:52:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:19,195 INFO L225 Difference]: With dead ends: 114 [2020-10-05 22:52:19,195 INFO L226 Difference]: Without dead ends: 89 [2020-10-05 22:52:19,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:52:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-05 22:52:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-05 22:52:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-05 22:52:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 179 transitions. [2020-10-05 22:52:19,199 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 179 transitions. Word has length 11 [2020-10-05 22:52:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:19,199 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 179 transitions. [2020-10-05 22:52:19,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:52:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 179 transitions. [2020-10-05 22:52:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:52:19,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:19,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:19,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:52:19,200 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1227689388, now seen corresponding path program 2 times [2020-10-05 22:52:19,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:19,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720708864] [2020-10-05 22:52:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:19,245 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-05 22:52:19,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720708864] [2020-10-05 22:52:19,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:19,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:52:19,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357882734] [2020-10-05 22:52:19,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:52:19,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:52:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:52:19,247 INFO L87 Difference]: Start difference. First operand 89 states and 179 transitions. Second operand 4 states. [2020-10-05 22:52:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:19,298 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2020-10-05 22:52:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:52:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 22:52:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:19,299 INFO L225 Difference]: With dead ends: 80 [2020-10-05 22:52:19,299 INFO L226 Difference]: Without dead ends: 58 [2020-10-05 22:52:19,300 INFO L675 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-05 22:52:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-05 22:52:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-10-05 22:52:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-05 22:52:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2020-10-05 22:52:19,302 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 92 transitions. Word has length 11 [2020-10-05 22:52:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:19,302 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 92 transitions. [2020-10-05 22:52:19,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:52:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 92 transitions. [2020-10-05 22:52:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:52:19,303 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:19,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:19,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:52:19,303 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1195880930, now seen corresponding path program 1 times [2020-10-05 22:52:19,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:19,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129968561] [2020-10-05 22:52:19,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:19,356 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-05 22:52:19,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129968561] [2020-10-05 22:52:19,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:19,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:52:19,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228392963] [2020-10-05 22:52:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:52:19,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:52:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:52:19,358 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. Second operand 5 states. [2020-10-05 22:52:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:19,391 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-10-05 22:52:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:52:19,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 22:52:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:19,392 INFO L225 Difference]: With dead ends: 45 [2020-10-05 22:52:19,392 INFO L226 Difference]: Without dead ends: 26 [2020-10-05 22:52:19,393 INFO L675 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-05 22:52:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-05 22:52:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-10-05 22:52:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 22:52:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-05 22:52:19,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-05 22:52:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:19,394 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-05 22:52:19,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:52:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-05 22:52:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:52:19,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:19,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:19,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:52:19,396 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1348623678, now seen corresponding path program 1 times [2020-10-05 22:52:19,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:19,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145051271] [2020-10-05 22:52:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:52:19,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-05 22:52:19,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145051271] [2020-10-05 22:52:19,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:52:19,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:52:19,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886545024] [2020-10-05 22:52:19,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:52:19,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:52:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:52:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:52:19,568 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 8 states. [2020-10-05 22:52:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:52:19,709 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-10-05 22:52:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:52:19,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-05 22:52:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:52:19,711 INFO L225 Difference]: With dead ends: 39 [2020-10-05 22:52:19,712 INFO L226 Difference]: Without dead ends: 27 [2020-10-05 22:52:19,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:52:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-05 22:52:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-10-05 22:52:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-05 22:52:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-05 22:52:19,714 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-05 22:52:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:52:19,715 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-05 22:52:19,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:52:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-05 22:52:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:52:19,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:52:19,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:52:19,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:52:19,716 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:52:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:52:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1278231562, now seen corresponding path program 2 times [2020-10-05 22:52:19,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:52:19,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067911492] [2020-10-05 22:52:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:52:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:52:19,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:52:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:52:19,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:52:19,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:52:19,873 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:52:19,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:52:19,875 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 22:52:19,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In-1027991051 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In-1027991051 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-1027991051 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-1027991051 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and (= ~x$w_buff0_used~0_In-1027991051 ~x$w_buff0_used~0_Out-1027991051) .cse0) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-1027991051 0))) (= ~x$r_buff1_thd0~0_In-1027991051 ~x$r_buff1_thd0~0_Out-1027991051) (or (and .cse1 (= ~x$w_buff0~0_In-1027991051 ~x~0_Out-1027991051) .cse2) (and (or (and (= ~x~0_Out-1027991051 ~x~0_In-1027991051) .cse3) (and .cse4 .cse5 (= ~x~0_Out-1027991051 ~x$w_buff1~0_In-1027991051))) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1027991051 0)) (= ~x$r_buff0_thd0~0_Out-1027991051 ~x$r_buff0_thd0~0_In-1027991051) (or (and .cse4 (= ~x$w_buff1_used~0_Out-1027991051 0) .cse5) (and .cse3 (= ~x$w_buff1_used~0_Out-1027991051 ~x$w_buff1_used~0_In-1027991051)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1027991051, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1027991051, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1027991051, ~x$w_buff1~0=~x$w_buff1~0_In-1027991051, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1027991051, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1027991051, ~x~0=~x~0_In-1027991051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1027991051} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1027991051, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1027991051, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1027991051|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1027991051|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1027991051|, ~x$w_buff1~0=~x$w_buff1~0_In-1027991051, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1027991051, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1027991051|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1027991051, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1027991051|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1027991051|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1027991051, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1027991051, ~x~0=~x~0_Out-1027991051} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 22:52:19,895 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-05 22:52:19,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,900 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-05 22:52:19,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,901 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-05 22:52:19,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,901 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-05 22:52:19,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,901 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-05 22:52:19,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,902 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-05 22:52:19,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,902 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-05 22:52:19,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,903 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-05 22:52:19,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,904 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-05 22:52:19,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,904 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-05 22:52:19,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,905 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-05 22:52:19,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,905 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-05 22:52:19,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,906 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-05 22:52:19,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,910 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-05 22:52:19,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,910 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-05 22:52:19,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,912 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-05 22:52:19,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,912 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-05 22:52:19,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,913 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-05 22:52:19,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,913 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-05 22:52:19,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,914 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-05 22:52:19,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,920 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-05 22:52:19,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,921 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-05 22:52:19,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:19,922 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-05 22:52:19,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:52:20,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:52:20 BasicIcfg [2020-10-05 22:52:20,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:52:20,027 INFO L168 Benchmark]: Toolchain (without parser) took 16059.61 ms. Allocated memory was 141.0 MB in the beginning and 415.8 MB in the end (delta: 274.7 MB). Free memory was 102.5 MB in the beginning and 287.8 MB in the end (delta: -185.3 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,027 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.12 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 159.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.69 ms. Allocated memory is still 205.0 MB. Free memory was 159.5 MB in the beginning and 155.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,029 INFO L168 Benchmark]: Boogie Preprocessor took 36.74 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,030 INFO L168 Benchmark]: RCFGBuilder took 2098.58 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 153.9 MB in the beginning and 186.2 MB in the end (delta: -32.4 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,031 INFO L168 Benchmark]: TraceAbstraction took 13126.22 ms. Allocated memory was 244.8 MB in the beginning and 415.8 MB in the end (delta: 170.9 MB). Free memory was 186.2 MB in the beginning and 287.8 MB in the end (delta: -101.6 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:52:20,035 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.12 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 159.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.69 ms. Allocated memory is still 205.0 MB. Free memory was 159.5 MB in the beginning and 155.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.74 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2098.58 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 153.9 MB in the beginning and 186.2 MB in the end (delta: -32.4 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13126.22 ms. Allocated memory was 244.8 MB in the beginning and 415.8 MB in the end (delta: 170.9 MB). Free memory was 186.2 MB in the beginning and 287.8 MB in the end (delta: -101.6 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.6s, 79 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 20 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 455 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 2260 CheckedPairsTotal, 65 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2475; [L780] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2476; [L782] FCALL, FORK 0 pthread_create(&t2476, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 230 SDtfs, 176 SDslu, 280 SDs, 0 SdLazy, 283 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 15 MinimizatonAttempts, 41 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 9561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...