./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9cb150e40ff5be2465128aade66c395f6c686f1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:44:46,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:44:46,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:44:46,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:44:46,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:44:46,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:44:46,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:44:46,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:44:46,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:44:46,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:44:46,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:44:46,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:44:46,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:44:46,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:44:46,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:44:46,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:44:46,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:44:46,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:44:46,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:44:46,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:44:46,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:44:46,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:44:46,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:44:46,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:44:46,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:44:46,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:44:46,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:44:46,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:44:46,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:44:46,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:44:46,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:44:46,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:44:46,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:44:46,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:44:46,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:44:46,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:44:46,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:44:46,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:44:46,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:44:46,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:44:46,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:44:46,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:44:46,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:44:46,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:44:46,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:44:46,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:44:46,814 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:44:46,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:44:46,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:44:46,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:44:46,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:44:46,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:44:46,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:44:46,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:44:46,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:44:46,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:44:46,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:44:46,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:44:46,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:44:46,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:44:46,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:44:46,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:44:46,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:44:46,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:44:46,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:44:46,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:44:46,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:44:46,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:44:46,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:44:46,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:44:46,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9cb150e40ff5be2465128aade66c395f6c686f1 [2019-11-15 20:44:46,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:44:46,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:44:46,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:44:46,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:44:46,868 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:44:46,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2019-11-15 20:44:46,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/data/c01db1707/0d4199fef07e43359832916365f69b89/FLAG1bf331d1b [2019-11-15 20:44:47,492 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:44:47,493 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2019-11-15 20:44:47,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/data/c01db1707/0d4199fef07e43359832916365f69b89/FLAG1bf331d1b [2019-11-15 20:44:47,767 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/data/c01db1707/0d4199fef07e43359832916365f69b89 [2019-11-15 20:44:47,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:44:47,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:44:47,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:47,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:44:47,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:44:47,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:47" (1/1) ... [2019-11-15 20:44:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9d236b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:47, skipping insertion in model container [2019-11-15 20:44:47,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:47" (1/1) ... [2019-11-15 20:44:47,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:44:47,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:44:48,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:48,467 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:44:48,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:48,653 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:44:48,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48 WrapperNode [2019-11-15 20:44:48,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:48,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:48,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:44:48,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:44:48,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:48,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:44:48,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:44:48,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:44:48,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... [2019-11-15 20:44:48,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:44:48,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:44:48,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:44:48,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:44:48,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/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 [2019-11-15 20:44:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:44:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:44:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:44:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:44:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:44:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:44:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:44:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:44:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:44:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:44:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:44:48,906 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:44:49,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:44:49,954 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:44:49,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:49 BoogieIcfgContainer [2019-11-15 20:44:49,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:44:49,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:44:49,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:44:49,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:44:49,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:44:47" (1/3) ... [2019-11-15 20:44:49,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a25ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:44:49, skipping insertion in model container [2019-11-15 20:44:49,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:48" (2/3) ... [2019-11-15 20:44:49,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a25ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:44:49, skipping insertion in model container [2019-11-15 20:44:49,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:49" (3/3) ... [2019-11-15 20:44:49,964 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-11-15 20:44:50,011 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,011 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,011 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,012 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,012 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,012 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,013 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,013 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,014 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,014 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,014 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,015 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,015 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,015 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,015 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,016 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,016 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,016 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,017 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,017 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,017 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,018 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,018 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,018 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,018 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,019 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,019 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,019 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,022 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,023 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:44:50,041 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:44:50,041 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:44:50,051 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:44:50,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:44:50,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:44:50,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:44:50,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:44:50,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:44:50,086 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:44:50,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:44:50,087 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:44:50,087 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:44:50,102 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 176 transitions [2019-11-15 20:44:52,115 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22508 states. [2019-11-15 20:44:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22508 states. [2019-11-15 20:44:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:44:52,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:52,130 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:52,134 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash -564804312, now seen corresponding path program 1 times [2019-11-15 20:44:52,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:52,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386854185] [2019-11-15 20:44:52,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:52,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:52,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:52,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386854185] [2019-11-15 20:44:52,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:52,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:44:52,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099593955] [2019-11-15 20:44:52,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:44:52,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:44:52,561 INFO L87 Difference]: Start difference. First operand 22508 states. Second operand 4 states. [2019-11-15 20:44:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:53,246 INFO L93 Difference]: Finished difference Result 23452 states and 91769 transitions. [2019-11-15 20:44:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:53,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 20:44:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:53,534 INFO L225 Difference]: With dead ends: 23452 [2019-11-15 20:44:53,535 INFO L226 Difference]: Without dead ends: 21276 [2019-11-15 20:44:53,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:44:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21276 states. [2019-11-15 20:44:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21276 to 21276. [2019-11-15 20:44:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21276 states. [2019-11-15 20:44:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21276 states to 21276 states and 83793 transitions. [2019-11-15 20:44:55,276 INFO L78 Accepts]: Start accepts. Automaton has 21276 states and 83793 transitions. Word has length 31 [2019-11-15 20:44:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:55,277 INFO L462 AbstractCegarLoop]: Abstraction has 21276 states and 83793 transitions. [2019-11-15 20:44:55,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:44:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 21276 states and 83793 transitions. [2019-11-15 20:44:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 20:44:55,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:55,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:55,292 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1206913622, now seen corresponding path program 1 times [2019-11-15 20:44:55,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:55,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613949638] [2019-11-15 20:44:55,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:55,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:55,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:55,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613949638] [2019-11-15 20:44:55,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:55,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:44:55,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427153809] [2019-11-15 20:44:55,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:44:55,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:44:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:44:55,423 INFO L87 Difference]: Start difference. First operand 21276 states and 83793 transitions. Second operand 5 states. [2019-11-15 20:44:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:56,813 INFO L93 Difference]: Finished difference Result 34710 states and 129089 transitions. [2019-11-15 20:44:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:44:56,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-15 20:44:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:56,999 INFO L225 Difference]: With dead ends: 34710 [2019-11-15 20:44:57,000 INFO L226 Difference]: Without dead ends: 34566 [2019-11-15 20:44:57,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:44:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34566 states. [2019-11-15 20:44:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34566 to 33066. [2019-11-15 20:44:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33066 states. [2019-11-15 20:44:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33066 states to 33066 states and 123977 transitions. [2019-11-15 20:44:58,678 INFO L78 Accepts]: Start accepts. Automaton has 33066 states and 123977 transitions. Word has length 42 [2019-11-15 20:44:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:58,681 INFO L462 AbstractCegarLoop]: Abstraction has 33066 states and 123977 transitions. [2019-11-15 20:44:58,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:44:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33066 states and 123977 transitions. [2019-11-15 20:44:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 20:44:58,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:58,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:58,690 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1177190009, now seen corresponding path program 1 times [2019-11-15 20:44:58,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:58,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258033031] [2019-11-15 20:44:58,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:58,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:58,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:58,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258033031] [2019-11-15 20:44:58,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:58,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:44:58,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706605360] [2019-11-15 20:44:58,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:44:58,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:44:58,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:44:58,839 INFO L87 Difference]: Start difference. First operand 33066 states and 123977 transitions. Second operand 5 states. [2019-11-15 20:45:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:00,128 INFO L93 Difference]: Finished difference Result 40218 states and 148646 transitions. [2019-11-15 20:45:00,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:00,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 20:45:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:00,334 INFO L225 Difference]: With dead ends: 40218 [2019-11-15 20:45:00,335 INFO L226 Difference]: Without dead ends: 40058 [2019-11-15 20:45:00,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40058 states. [2019-11-15 20:45:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40058 to 34639. [2019-11-15 20:45:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34639 states. [2019-11-15 20:45:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34639 states to 34639 states and 129273 transitions. [2019-11-15 20:45:01,680 INFO L78 Accepts]: Start accepts. Automaton has 34639 states and 129273 transitions. Word has length 43 [2019-11-15 20:45:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:01,681 INFO L462 AbstractCegarLoop]: Abstraction has 34639 states and 129273 transitions. [2019-11-15 20:45:01,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 34639 states and 129273 transitions. [2019-11-15 20:45:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:45:01,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:01,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:01,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1468049762, now seen corresponding path program 1 times [2019-11-15 20:45:01,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:01,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809960921] [2019-11-15 20:45:01,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:01,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:01,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:01,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809960921] [2019-11-15 20:45:01,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:01,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:01,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721031865] [2019-11-15 20:45:01,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:01,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:01,860 INFO L87 Difference]: Start difference. First operand 34639 states and 129273 transitions. Second operand 6 states. [2019-11-15 20:45:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:03,897 INFO L93 Difference]: Finished difference Result 45667 states and 166167 transitions. [2019-11-15 20:45:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:45:03,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-15 20:45:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:04,116 INFO L225 Difference]: With dead ends: 45667 [2019-11-15 20:45:04,116 INFO L226 Difference]: Without dead ends: 45523 [2019-11-15 20:45:04,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:45:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45523 states. [2019-11-15 20:45:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45523 to 33602. [2019-11-15 20:45:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33602 states. [2019-11-15 20:45:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33602 states to 33602 states and 125428 transitions. [2019-11-15 20:45:05,142 INFO L78 Accepts]: Start accepts. Automaton has 33602 states and 125428 transitions. Word has length 50 [2019-11-15 20:45:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:05,143 INFO L462 AbstractCegarLoop]: Abstraction has 33602 states and 125428 transitions. [2019-11-15 20:45:05,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33602 states and 125428 transitions. [2019-11-15 20:45:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 20:45:05,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:05,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:05,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -345936719, now seen corresponding path program 1 times [2019-11-15 20:45:05,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:05,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796225619] [2019-11-15 20:45:05,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:05,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:05,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:05,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796225619] [2019-11-15 20:45:05,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:05,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:05,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735397193] [2019-11-15 20:45:05,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:05,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:05,315 INFO L87 Difference]: Start difference. First operand 33602 states and 125428 transitions. Second operand 6 states. [2019-11-15 20:45:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:06,735 INFO L93 Difference]: Finished difference Result 46074 states and 167861 transitions. [2019-11-15 20:45:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:45:06,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-15 20:45:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:06,858 INFO L225 Difference]: With dead ends: 46074 [2019-11-15 20:45:06,858 INFO L226 Difference]: Without dead ends: 45834 [2019-11-15 20:45:06,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:45:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45834 states. [2019-11-15 20:45:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45834 to 39963. [2019-11-15 20:45:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39963 states. [2019-11-15 20:45:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39963 states to 39963 states and 147352 transitions. [2019-11-15 20:45:07,841 INFO L78 Accepts]: Start accepts. Automaton has 39963 states and 147352 transitions. Word has length 57 [2019-11-15 20:45:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:07,842 INFO L462 AbstractCegarLoop]: Abstraction has 39963 states and 147352 transitions. [2019-11-15 20:45:07,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 39963 states and 147352 transitions. [2019-11-15 20:45:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:45:07,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:07,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:07,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -480456418, now seen corresponding path program 1 times [2019-11-15 20:45:07,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:07,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134025441] [2019-11-15 20:45:07,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:07,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:07,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:07,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134025441] [2019-11-15 20:45:07,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:07,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:07,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927980222] [2019-11-15 20:45:07,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:07,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:07,963 INFO L87 Difference]: Start difference. First operand 39963 states and 147352 transitions. Second operand 3 states. [2019-11-15 20:45:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:08,258 INFO L93 Difference]: Finished difference Result 50261 states and 182187 transitions. [2019-11-15 20:45:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:08,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-15 20:45:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:08,375 INFO L225 Difference]: With dead ends: 50261 [2019-11-15 20:45:08,376 INFO L226 Difference]: Without dead ends: 50261 [2019-11-15 20:45:08,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50261 states. [2019-11-15 20:45:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50261 to 43893. [2019-11-15 20:45:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43893 states. [2019-11-15 20:45:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43893 states to 43893 states and 160790 transitions. [2019-11-15 20:45:10,172 INFO L78 Accepts]: Start accepts. Automaton has 43893 states and 160790 transitions. Word has length 59 [2019-11-15 20:45:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:10,173 INFO L462 AbstractCegarLoop]: Abstraction has 43893 states and 160790 transitions. [2019-11-15 20:45:10,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43893 states and 160790 transitions. [2019-11-15 20:45:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:45:10,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:10,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:10,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1618566875, now seen corresponding path program 1 times [2019-11-15 20:45:10,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:10,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825670937] [2019-11-15 20:45:10,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:10,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:10,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:10,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825670937] [2019-11-15 20:45:10,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:10,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:10,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073219972] [2019-11-15 20:45:10,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:10,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:10,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:10,319 INFO L87 Difference]: Start difference. First operand 43893 states and 160790 transitions. Second operand 7 states. [2019-11-15 20:45:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:11,497 INFO L93 Difference]: Finished difference Result 55889 states and 200524 transitions. [2019-11-15 20:45:11,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:45:11,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-15 20:45:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:11,648 INFO L225 Difference]: With dead ends: 55889 [2019-11-15 20:45:11,648 INFO L226 Difference]: Without dead ends: 55649 [2019-11-15 20:45:11,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:45:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55649 states. [2019-11-15 20:45:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55649 to 45119. [2019-11-15 20:45:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45119 states. [2019-11-15 20:45:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45119 states to 45119 states and 164957 transitions. [2019-11-15 20:45:12,672 INFO L78 Accepts]: Start accepts. Automaton has 45119 states and 164957 transitions. Word has length 63 [2019-11-15 20:45:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:12,673 INFO L462 AbstractCegarLoop]: Abstraction has 45119 states and 164957 transitions. [2019-11-15 20:45:12,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 45119 states and 164957 transitions. [2019-11-15 20:45:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:45:12,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:12,716 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:12,716 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 543755656, now seen corresponding path program 1 times [2019-11-15 20:45:12,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:12,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809074701] [2019-11-15 20:45:12,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:12,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:12,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:12,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809074701] [2019-11-15 20:45:12,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:12,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:12,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140298504] [2019-11-15 20:45:12,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:12,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:12,835 INFO L87 Difference]: Start difference. First operand 45119 states and 164957 transitions. Second operand 7 states. [2019-11-15 20:45:14,093 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-11-15 20:45:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:14,443 INFO L93 Difference]: Finished difference Result 55103 states and 197701 transitions. [2019-11-15 20:45:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:45:14,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-15 20:45:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:14,583 INFO L225 Difference]: With dead ends: 55103 [2019-11-15 20:45:14,583 INFO L226 Difference]: Without dead ends: 54903 [2019-11-15 20:45:14,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:45:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54903 states. [2019-11-15 20:45:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54903 to 45997. [2019-11-15 20:45:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45997 states. [2019-11-15 20:45:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45997 states to 45997 states and 167828 transitions. [2019-11-15 20:45:15,558 INFO L78 Accepts]: Start accepts. Automaton has 45997 states and 167828 transitions. Word has length 64 [2019-11-15 20:45:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:15,558 INFO L462 AbstractCegarLoop]: Abstraction has 45997 states and 167828 transitions. [2019-11-15 20:45:15,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45997 states and 167828 transitions. [2019-11-15 20:45:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:45:15,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:15,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:15,597 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1344094873, now seen corresponding path program 1 times [2019-11-15 20:45:15,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:15,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102791312] [2019-11-15 20:45:15,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:15,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:15,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:15,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102791312] [2019-11-15 20:45:15,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:15,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:15,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115575897] [2019-11-15 20:45:15,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:15,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:15,738 INFO L87 Difference]: Start difference. First operand 45997 states and 167828 transitions. Second operand 6 states. [2019-11-15 20:45:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:16,782 INFO L93 Difference]: Finished difference Result 65557 states and 237355 transitions. [2019-11-15 20:45:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:16,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:45:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:16,943 INFO L225 Difference]: With dead ends: 65557 [2019-11-15 20:45:16,943 INFO L226 Difference]: Without dead ends: 64913 [2019-11-15 20:45:16,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64913 states. [2019-11-15 20:45:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64913 to 56047. [2019-11-15 20:45:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56047 states. [2019-11-15 20:45:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56047 states to 56047 states and 204358 transitions. [2019-11-15 20:45:18,218 INFO L78 Accepts]: Start accepts. Automaton has 56047 states and 204358 transitions. Word has length 66 [2019-11-15 20:45:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:18,218 INFO L462 AbstractCegarLoop]: Abstraction has 56047 states and 204358 transitions. [2019-11-15 20:45:18,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56047 states and 204358 transitions. [2019-11-15 20:45:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:45:18,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:18,277 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:18,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:18,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258406, now seen corresponding path program 1 times [2019-11-15 20:45:18,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:18,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959898615] [2019-11-15 20:45:18,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:19,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959898615] [2019-11-15 20:45:19,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:19,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:19,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237472994] [2019-11-15 20:45:19,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:19,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:19,105 INFO L87 Difference]: Start difference. First operand 56047 states and 204358 transitions. Second operand 7 states. [2019-11-15 20:45:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,524 INFO L93 Difference]: Finished difference Result 83035 states and 292786 transitions. [2019-11-15 20:45:20,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:45:20,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 20:45:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,727 INFO L225 Difference]: With dead ends: 83035 [2019-11-15 20:45:20,727 INFO L226 Difference]: Without dead ends: 83035 [2019-11-15 20:45:20,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83035 states. [2019-11-15 20:45:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83035 to 76084. [2019-11-15 20:45:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76084 states. [2019-11-15 20:45:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76084 states to 76084 states and 270653 transitions. [2019-11-15 20:45:22,342 INFO L78 Accepts]: Start accepts. Automaton has 76084 states and 270653 transitions. Word has length 66 [2019-11-15 20:45:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 76084 states and 270653 transitions. [2019-11-15 20:45:22,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76084 states and 270653 transitions. [2019-11-15 20:45:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:45:22,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:22,431 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:22,431 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash -744493925, now seen corresponding path program 1 times [2019-11-15 20:45:22,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:22,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242006691] [2019-11-15 20:45:22,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:22,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242006691] [2019-11-15 20:45:22,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:22,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:22,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027967261] [2019-11-15 20:45:22,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:22,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:22,546 INFO L87 Difference]: Start difference. First operand 76084 states and 270653 transitions. Second operand 4 states. [2019-11-15 20:45:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:22,650 INFO L93 Difference]: Finished difference Result 17229 states and 54531 transitions. [2019-11-15 20:45:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:22,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:45:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:22,680 INFO L225 Difference]: With dead ends: 17229 [2019-11-15 20:45:22,680 INFO L226 Difference]: Without dead ends: 16751 [2019-11-15 20:45:22,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16751 states. [2019-11-15 20:45:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16751 to 16739. [2019-11-15 20:45:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16739 states. [2019-11-15 20:45:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16739 states to 16739 states and 53026 transitions. [2019-11-15 20:45:22,939 INFO L78 Accepts]: Start accepts. Automaton has 16739 states and 53026 transitions. Word has length 66 [2019-11-15 20:45:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:22,940 INFO L462 AbstractCegarLoop]: Abstraction has 16739 states and 53026 transitions. [2019-11-15 20:45:22,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 16739 states and 53026 transitions. [2019-11-15 20:45:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:45:22,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:22,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:22,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash 263914028, now seen corresponding path program 1 times [2019-11-15 20:45:22,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:22,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620724262] [2019-11-15 20:45:22,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:23,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620724262] [2019-11-15 20:45:23,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:23,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:23,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124741051] [2019-11-15 20:45:23,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:23,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:23,037 INFO L87 Difference]: Start difference. First operand 16739 states and 53026 transitions. Second operand 4 states. [2019-11-15 20:45:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:23,368 INFO L93 Difference]: Finished difference Result 22103 states and 69107 transitions. [2019-11-15 20:45:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:23,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:45:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:23,406 INFO L225 Difference]: With dead ends: 22103 [2019-11-15 20:45:23,406 INFO L226 Difference]: Without dead ends: 22103 [2019-11-15 20:45:23,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22103 states. [2019-11-15 20:45:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22103 to 17615. [2019-11-15 20:45:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17615 states. [2019-11-15 20:45:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17615 states to 17615 states and 55585 transitions. [2019-11-15 20:45:23,922 INFO L78 Accepts]: Start accepts. Automaton has 17615 states and 55585 transitions. Word has length 76 [2019-11-15 20:45:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:23,922 INFO L462 AbstractCegarLoop]: Abstraction has 17615 states and 55585 transitions. [2019-11-15 20:45:23,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 17615 states and 55585 transitions. [2019-11-15 20:45:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:45:23,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:23,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:23,939 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash 9177483, now seen corresponding path program 1 times [2019-11-15 20:45:23,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:23,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698214504] [2019-11-15 20:45:23,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:23,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:23,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:24,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698214504] [2019-11-15 20:45:24,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:24,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:45:24,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752992901] [2019-11-15 20:45:24,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:45:24,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:45:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:24,068 INFO L87 Difference]: Start difference. First operand 17615 states and 55585 transitions. Second operand 8 states. [2019-11-15 20:45:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:25,425 INFO L93 Difference]: Finished difference Result 19709 states and 61661 transitions. [2019-11-15 20:45:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 20:45:25,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-11-15 20:45:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:25,460 INFO L225 Difference]: With dead ends: 19709 [2019-11-15 20:45:25,460 INFO L226 Difference]: Without dead ends: 19661 [2019-11-15 20:45:25,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:45:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19661 states. [2019-11-15 20:45:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19661 to 15533. [2019-11-15 20:45:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15533 states. [2019-11-15 20:45:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15533 states to 15533 states and 49319 transitions. [2019-11-15 20:45:25,737 INFO L78 Accepts]: Start accepts. Automaton has 15533 states and 49319 transitions. Word has length 76 [2019-11-15 20:45:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:25,737 INFO L462 AbstractCegarLoop]: Abstraction has 15533 states and 49319 transitions. [2019-11-15 20:45:25,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:45:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15533 states and 49319 transitions. [2019-11-15 20:45:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 20:45:25,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:25,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:25,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash -760558455, now seen corresponding path program 1 times [2019-11-15 20:45:25,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:25,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247606403] [2019-11-15 20:45:25,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:25,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:25,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:25,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247606403] [2019-11-15 20:45:25,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:25,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:25,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284769502] [2019-11-15 20:45:25,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:25,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:25,808 INFO L87 Difference]: Start difference. First operand 15533 states and 49319 transitions. Second operand 3 states. [2019-11-15 20:45:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:26,181 INFO L93 Difference]: Finished difference Result 16797 states and 53032 transitions. [2019-11-15 20:45:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:26,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-15 20:45:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:26,221 INFO L225 Difference]: With dead ends: 16797 [2019-11-15 20:45:26,221 INFO L226 Difference]: Without dead ends: 16797 [2019-11-15 20:45:26,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16797 states. [2019-11-15 20:45:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16797 to 16149. [2019-11-15 20:45:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16149 states. [2019-11-15 20:45:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16149 states to 16149 states and 51133 transitions. [2019-11-15 20:45:26,482 INFO L78 Accepts]: Start accepts. Automaton has 16149 states and 51133 transitions. Word has length 77 [2019-11-15 20:45:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:26,483 INFO L462 AbstractCegarLoop]: Abstraction has 16149 states and 51133 transitions. [2019-11-15 20:45:26,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 16149 states and 51133 transitions. [2019-11-15 20:45:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:45:26,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:26,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:26,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1482177058, now seen corresponding path program 1 times [2019-11-15 20:45:26,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:26,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739971902] [2019-11-15 20:45:26,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:26,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:26,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739971902] [2019-11-15 20:45:26,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:26,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:26,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375076417] [2019-11-15 20:45:26,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:26,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:26,581 INFO L87 Difference]: Start difference. First operand 16149 states and 51133 transitions. Second operand 4 states. [2019-11-15 20:45:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:26,918 INFO L93 Difference]: Finished difference Result 19317 states and 60263 transitions. [2019-11-15 20:45:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:45:26,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 20:45:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:26,950 INFO L225 Difference]: With dead ends: 19317 [2019-11-15 20:45:26,951 INFO L226 Difference]: Without dead ends: 19317 [2019-11-15 20:45:26,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19317 states. [2019-11-15 20:45:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19317 to 18294. [2019-11-15 20:45:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18294 states. [2019-11-15 20:45:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18294 states to 18294 states and 57379 transitions. [2019-11-15 20:45:27,253 INFO L78 Accepts]: Start accepts. Automaton has 18294 states and 57379 transitions. Word has length 78 [2019-11-15 20:45:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:27,253 INFO L462 AbstractCegarLoop]: Abstraction has 18294 states and 57379 transitions. [2019-11-15 20:45:27,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18294 states and 57379 transitions. [2019-11-15 20:45:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:45:27,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:27,273 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:27,274 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash 877129951, now seen corresponding path program 1 times [2019-11-15 20:45:27,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:27,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831295635] [2019-11-15 20:45:27,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:27,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:27,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:27,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831295635] [2019-11-15 20:45:27,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:27,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:27,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137229652] [2019-11-15 20:45:27,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:27,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:27,326 INFO L87 Difference]: Start difference. First operand 18294 states and 57379 transitions. Second operand 3 states. [2019-11-15 20:45:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:27,671 INFO L93 Difference]: Finished difference Result 19637 states and 61302 transitions. [2019-11-15 20:45:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:27,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-15 20:45:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:27,706 INFO L225 Difference]: With dead ends: 19637 [2019-11-15 20:45:27,706 INFO L226 Difference]: Without dead ends: 19637 [2019-11-15 20:45:27,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19637 states. [2019-11-15 20:45:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19637 to 18974. [2019-11-15 20:45:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18974 states. [2019-11-15 20:45:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18974 states to 18974 states and 59359 transitions. [2019-11-15 20:45:28,003 INFO L78 Accepts]: Start accepts. Automaton has 18974 states and 59359 transitions. Word has length 78 [2019-11-15 20:45:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:28,003 INFO L462 AbstractCegarLoop]: Abstraction has 18974 states and 59359 transitions. [2019-11-15 20:45:28,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18974 states and 59359 transitions. [2019-11-15 20:45:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:28,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:28,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:28,023 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1829246556, now seen corresponding path program 1 times [2019-11-15 20:45:28,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:28,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858530136] [2019-11-15 20:45:28,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:28,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:28,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:28,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858530136] [2019-11-15 20:45:28,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:28,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:45:28,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586065301] [2019-11-15 20:45:28,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:45:28,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:45:28,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:28,155 INFO L87 Difference]: Start difference. First operand 18974 states and 59359 transitions. Second operand 8 states. [2019-11-15 20:45:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:30,864 INFO L93 Difference]: Finished difference Result 52656 states and 160090 transitions. [2019-11-15 20:45:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:45:30,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-11-15 20:45:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:30,990 INFO L225 Difference]: With dead ends: 52656 [2019-11-15 20:45:30,991 INFO L226 Difference]: Without dead ends: 52239 [2019-11-15 20:45:30,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:45:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52239 states. [2019-11-15 20:45:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52239 to 28681. [2019-11-15 20:45:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28681 states. [2019-11-15 20:45:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28681 states to 28681 states and 89257 transitions. [2019-11-15 20:45:31,872 INFO L78 Accepts]: Start accepts. Automaton has 28681 states and 89257 transitions. Word has length 79 [2019-11-15 20:45:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:31,873 INFO L462 AbstractCegarLoop]: Abstraction has 28681 states and 89257 transitions. [2019-11-15 20:45:31,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:45:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28681 states and 89257 transitions. [2019-11-15 20:45:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:31,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:31,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:31,916 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -259342242, now seen corresponding path program 1 times [2019-11-15 20:45:31,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:31,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071155465] [2019-11-15 20:45:31,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:31,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:31,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:32,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071155465] [2019-11-15 20:45:32,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:32,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:32,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296029706] [2019-11-15 20:45:32,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:32,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:32,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:32,067 INFO L87 Difference]: Start difference. First operand 28681 states and 89257 transitions. Second operand 6 states. [2019-11-15 20:45:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:32,997 INFO L93 Difference]: Finished difference Result 30406 states and 93750 transitions. [2019-11-15 20:45:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:32,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-11-15 20:45:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:33,051 INFO L225 Difference]: With dead ends: 30406 [2019-11-15 20:45:33,051 INFO L226 Difference]: Without dead ends: 30406 [2019-11-15 20:45:33,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30406 states. [2019-11-15 20:45:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30406 to 29148. [2019-11-15 20:45:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29148 states. [2019-11-15 20:45:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29148 states to 29148 states and 90159 transitions. [2019-11-15 20:45:33,584 INFO L78 Accepts]: Start accepts. Automaton has 29148 states and 90159 transitions. Word has length 79 [2019-11-15 20:45:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:33,584 INFO L462 AbstractCegarLoop]: Abstraction has 29148 states and 90159 transitions. [2019-11-15 20:45:33,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29148 states and 90159 transitions. [2019-11-15 20:45:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:33,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:33,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:33,622 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:33,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964767, now seen corresponding path program 1 times [2019-11-15 20:45:33,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:33,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823271968] [2019-11-15 20:45:33,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:33,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:33,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:33,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823271968] [2019-11-15 20:45:33,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:33,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:33,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414804513] [2019-11-15 20:45:33,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:33,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:33,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:33,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:33,761 INFO L87 Difference]: Start difference. First operand 29148 states and 90159 transitions. Second operand 7 states. [2019-11-15 20:45:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:34,500 INFO L93 Difference]: Finished difference Result 30833 states and 94867 transitions. [2019-11-15 20:45:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:45:34,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-15 20:45:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:34,551 INFO L225 Difference]: With dead ends: 30833 [2019-11-15 20:45:34,551 INFO L226 Difference]: Without dead ends: 30833 [2019-11-15 20:45:34,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30833 states. [2019-11-15 20:45:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30833 to 29511. [2019-11-15 20:45:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29511 states. [2019-11-15 20:45:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29511 states to 29511 states and 91024 transitions. [2019-11-15 20:45:35,020 INFO L78 Accepts]: Start accepts. Automaton has 29511 states and 91024 transitions. Word has length 79 [2019-11-15 20:45:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:35,021 INFO L462 AbstractCegarLoop]: Abstraction has 29511 states and 91024 transitions. [2019-11-15 20:45:35,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29511 states and 91024 transitions. [2019-11-15 20:45:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:35,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:35,051 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:35,051 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1865236768, now seen corresponding path program 1 times [2019-11-15 20:45:35,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:35,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628425704] [2019-11-15 20:45:35,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:35,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:35,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:35,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628425704] [2019-11-15 20:45:35,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:35,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:35,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164409450] [2019-11-15 20:45:35,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:35,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:35,111 INFO L87 Difference]: Start difference. First operand 29511 states and 91024 transitions. Second operand 3 states. [2019-11-15 20:45:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:35,223 INFO L93 Difference]: Finished difference Result 22464 states and 68729 transitions. [2019-11-15 20:45:35,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:35,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-15 20:45:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:35,262 INFO L225 Difference]: With dead ends: 22464 [2019-11-15 20:45:35,262 INFO L226 Difference]: Without dead ends: 22464 [2019-11-15 20:45:35,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22464 states. [2019-11-15 20:45:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22464 to 21650. [2019-11-15 20:45:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21650 states. [2019-11-15 20:45:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21650 states to 21650 states and 66413 transitions. [2019-11-15 20:45:35,601 INFO L78 Accepts]: Start accepts. Automaton has 21650 states and 66413 transitions. Word has length 79 [2019-11-15 20:45:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:35,602 INFO L462 AbstractCegarLoop]: Abstraction has 21650 states and 66413 transitions. [2019-11-15 20:45:35,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 21650 states and 66413 transitions. [2019-11-15 20:45:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:35,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:35,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:35,625 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -565864143, now seen corresponding path program 1 times [2019-11-15 20:45:35,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:35,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098753876] [2019-11-15 20:45:35,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:35,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:35,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:35,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098753876] [2019-11-15 20:45:35,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:35,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:35,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694600501] [2019-11-15 20:45:35,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:35,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:35,742 INFO L87 Difference]: Start difference. First operand 21650 states and 66413 transitions. Second operand 5 states. [2019-11-15 20:45:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:35,947 INFO L93 Difference]: Finished difference Result 31338 states and 95665 transitions. [2019-11-15 20:45:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:35,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-15 20:45:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:36,020 INFO L225 Difference]: With dead ends: 31338 [2019-11-15 20:45:36,020 INFO L226 Difference]: Without dead ends: 31338 [2019-11-15 20:45:36,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31338 states. [2019-11-15 20:45:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31338 to 20557. [2019-11-15 20:45:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20557 states. [2019-11-15 20:45:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20557 states to 20557 states and 61826 transitions. [2019-11-15 20:45:36,437 INFO L78 Accepts]: Start accepts. Automaton has 20557 states and 61826 transitions. Word has length 79 [2019-11-15 20:45:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:36,437 INFO L462 AbstractCegarLoop]: Abstraction has 20557 states and 61826 transitions. [2019-11-15 20:45:36,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20557 states and 61826 transitions. [2019-11-15 20:45:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:45:36,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:36,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:36,459 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1159616754, now seen corresponding path program 1 times [2019-11-15 20:45:36,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:36,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425744581] [2019-11-15 20:45:36,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:36,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:36,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:36,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425744581] [2019-11-15 20:45:36,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:36,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:36,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166200935] [2019-11-15 20:45:36,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:36,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:36,548 INFO L87 Difference]: Start difference. First operand 20557 states and 61826 transitions. Second operand 5 states. [2019-11-15 20:45:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:36,612 INFO L93 Difference]: Finished difference Result 3073 states and 7459 transitions. [2019-11-15 20:45:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:36,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-15 20:45:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:36,617 INFO L225 Difference]: With dead ends: 3073 [2019-11-15 20:45:36,617 INFO L226 Difference]: Without dead ends: 2671 [2019-11-15 20:45:36,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-11-15 20:45:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2413. [2019-11-15 20:45:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-11-15 20:45:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 5852 transitions. [2019-11-15 20:45:36,658 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 5852 transitions. Word has length 79 [2019-11-15 20:45:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:36,658 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 5852 transitions. [2019-11-15 20:45:36,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 5852 transitions. [2019-11-15 20:45:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:45:36,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:36,662 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:36,663 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1143530068, now seen corresponding path program 1 times [2019-11-15 20:45:36,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:36,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528560764] [2019-11-15 20:45:36,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:36,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:36,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:36,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528560764] [2019-11-15 20:45:36,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:36,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:36,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006670145] [2019-11-15 20:45:36,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:36,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:36,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:36,788 INFO L87 Difference]: Start difference. First operand 2413 states and 5852 transitions. Second operand 6 states. [2019-11-15 20:45:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:37,166 INFO L93 Difference]: Finished difference Result 2575 states and 6143 transitions. [2019-11-15 20:45:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:37,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-15 20:45:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:37,170 INFO L225 Difference]: With dead ends: 2575 [2019-11-15 20:45:37,170 INFO L226 Difference]: Without dead ends: 2539 [2019-11-15 20:45:37,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-11-15 20:45:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2497. [2019-11-15 20:45:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2497 states. [2019-11-15 20:45:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 6008 transitions. [2019-11-15 20:45:37,210 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 6008 transitions. Word has length 91 [2019-11-15 20:45:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:37,210 INFO L462 AbstractCegarLoop]: Abstraction has 2497 states and 6008 transitions. [2019-11-15 20:45:37,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 6008 transitions. [2019-11-15 20:45:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:45:37,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:37,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:37,214 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 966204787, now seen corresponding path program 1 times [2019-11-15 20:45:37,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:37,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959685136] [2019-11-15 20:45:37,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:37,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:37,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:37,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959685136] [2019-11-15 20:45:37,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:37,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:37,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240516449] [2019-11-15 20:45:37,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:37,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:37,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:37,377 INFO L87 Difference]: Start difference. First operand 2497 states and 6008 transitions. Second operand 7 states. [2019-11-15 20:45:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:37,732 INFO L93 Difference]: Finished difference Result 3461 states and 8173 transitions. [2019-11-15 20:45:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:45:37,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-15 20:45:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:37,736 INFO L225 Difference]: With dead ends: 3461 [2019-11-15 20:45:37,736 INFO L226 Difference]: Without dead ends: 3443 [2019-11-15 20:45:37,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:45:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2019-11-15 20:45:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 2926. [2019-11-15 20:45:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-11-15 20:45:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 6955 transitions. [2019-11-15 20:45:37,772 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 6955 transitions. Word has length 91 [2019-11-15 20:45:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:37,773 INFO L462 AbstractCegarLoop]: Abstraction has 2926 states and 6955 transitions. [2019-11-15 20:45:37,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 6955 transitions. [2019-11-15 20:45:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:45:37,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:37,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:37,776 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1927818804, now seen corresponding path program 1 times [2019-11-15 20:45:37,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:37,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591090150] [2019-11-15 20:45:37,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:37,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:37,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:37,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591090150] [2019-11-15 20:45:37,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:37,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:37,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884456528] [2019-11-15 20:45:37,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:37,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:37,933 INFO L87 Difference]: Start difference. First operand 2926 states and 6955 transitions. Second operand 6 states. [2019-11-15 20:45:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:38,093 INFO L93 Difference]: Finished difference Result 2674 states and 6223 transitions. [2019-11-15 20:45:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:38,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-15 20:45:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:38,096 INFO L225 Difference]: With dead ends: 2674 [2019-11-15 20:45:38,096 INFO L226 Difference]: Without dead ends: 2674 [2019-11-15 20:45:38,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-15 20:45:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1978. [2019-11-15 20:45:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-15 20:45:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 4712 transitions. [2019-11-15 20:45:38,121 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 4712 transitions. Word has length 91 [2019-11-15 20:45:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 4712 transitions. [2019-11-15 20:45:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 4712 transitions. [2019-11-15 20:45:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:38,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:38,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:38,124 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 417222268, now seen corresponding path program 1 times [2019-11-15 20:45:38,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:38,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117216073] [2019-11-15 20:45:38,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:38,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117216073] [2019-11-15 20:45:38,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:38,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:38,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062829709] [2019-11-15 20:45:38,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:38,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:38,287 INFO L87 Difference]: Start difference. First operand 1978 states and 4712 transitions. Second operand 7 states. [2019-11-15 20:45:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:38,714 INFO L93 Difference]: Finished difference Result 2756 states and 6386 transitions. [2019-11-15 20:45:38,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:45:38,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:45:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:38,717 INFO L225 Difference]: With dead ends: 2756 [2019-11-15 20:45:38,717 INFO L226 Difference]: Without dead ends: 2728 [2019-11-15 20:45:38,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:45:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-11-15 20:45:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2050. [2019-11-15 20:45:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2019-11-15 20:45:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 4850 transitions. [2019-11-15 20:45:38,744 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 4850 transitions. Word has length 93 [2019-11-15 20:45:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:38,744 INFO L462 AbstractCegarLoop]: Abstraction has 2050 states and 4850 transitions. [2019-11-15 20:45:38,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 4850 transitions. [2019-11-15 20:45:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:38,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:38,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:38,747 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1518438019, now seen corresponding path program 1 times [2019-11-15 20:45:38,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:38,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194685963] [2019-11-15 20:45:38,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:38,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194685963] [2019-11-15 20:45:38,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:38,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:38,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830201967] [2019-11-15 20:45:38,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:38,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:38,848 INFO L87 Difference]: Start difference. First operand 2050 states and 4850 transitions. Second operand 5 states. [2019-11-15 20:45:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:39,099 INFO L93 Difference]: Finished difference Result 2302 states and 5429 transitions. [2019-11-15 20:45:39,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:39,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 20:45:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:39,102 INFO L225 Difference]: With dead ends: 2302 [2019-11-15 20:45:39,102 INFO L226 Difference]: Without dead ends: 2284 [2019-11-15 20:45:39,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-11-15 20:45:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2077. [2019-11-15 20:45:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-11-15 20:45:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 4904 transitions. [2019-11-15 20:45:39,126 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 4904 transitions. Word has length 93 [2019-11-15 20:45:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:39,126 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 4904 transitions. [2019-11-15 20:45:39,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 4904 transitions. [2019-11-15 20:45:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:39,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:39,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:39,129 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -273673538, now seen corresponding path program 1 times [2019-11-15 20:45:39,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:39,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894593470] [2019-11-15 20:45:39,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:39,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894593470] [2019-11-15 20:45:39,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:39,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:39,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773799710] [2019-11-15 20:45:39,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:39,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:39,280 INFO L87 Difference]: Start difference. First operand 2077 states and 4904 transitions. Second operand 7 states. [2019-11-15 20:45:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:39,418 INFO L93 Difference]: Finished difference Result 3369 states and 8056 transitions. [2019-11-15 20:45:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:39,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:45:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:39,421 INFO L225 Difference]: With dead ends: 3369 [2019-11-15 20:45:39,421 INFO L226 Difference]: Without dead ends: 1478 [2019-11-15 20:45:39,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-11-15 20:45:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1398. [2019-11-15 20:45:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-11-15 20:45:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 3347 transitions. [2019-11-15 20:45:39,436 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 3347 transitions. Word has length 93 [2019-11-15 20:45:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:39,436 INFO L462 AbstractCegarLoop]: Abstraction has 1398 states and 3347 transitions. [2019-11-15 20:45:39,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 3347 transitions. [2019-11-15 20:45:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:39,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:39,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:39,438 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -523972012, now seen corresponding path program 1 times [2019-11-15 20:45:39,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:39,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374322627] [2019-11-15 20:45:39,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:39,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374322627] [2019-11-15 20:45:39,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:39,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:39,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379702976] [2019-11-15 20:45:39,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:39,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:39,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:39,534 INFO L87 Difference]: Start difference. First operand 1398 states and 3347 transitions. Second operand 5 states. [2019-11-15 20:45:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:39,760 INFO L93 Difference]: Finished difference Result 1637 states and 3844 transitions. [2019-11-15 20:45:39,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:39,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 20:45:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:39,763 INFO L225 Difference]: With dead ends: 1637 [2019-11-15 20:45:39,764 INFO L226 Difference]: Without dead ends: 1619 [2019-11-15 20:45:39,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2019-11-15 20:45:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1403. [2019-11-15 20:45:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-11-15 20:45:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 3357 transitions. [2019-11-15 20:45:39,790 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 3357 transitions. Word has length 93 [2019-11-15 20:45:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:39,790 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 3357 transitions. [2019-11-15 20:45:39,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 3357 transitions. [2019-11-15 20:45:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:39,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:39,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:39,793 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2070254805, now seen corresponding path program 1 times [2019-11-15 20:45:39,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:39,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414190444] [2019-11-15 20:45:39,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:39,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:39,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414190444] [2019-11-15 20:45:39,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:39,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:39,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982195104] [2019-11-15 20:45:39,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:39,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:39,928 INFO L87 Difference]: Start difference. First operand 1403 states and 3357 transitions. Second operand 6 states. [2019-11-15 20:45:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:40,205 INFO L93 Difference]: Finished difference Result 1589 states and 3750 transitions. [2019-11-15 20:45:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:40,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:45:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:40,208 INFO L225 Difference]: With dead ends: 1589 [2019-11-15 20:45:40,208 INFO L226 Difference]: Without dead ends: 1589 [2019-11-15 20:45:40,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-11-15 20:45:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1379. [2019-11-15 20:45:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2019-11-15 20:45:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 3309 transitions. [2019-11-15 20:45:40,233 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 3309 transitions. Word has length 93 [2019-11-15 20:45:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:40,234 INFO L462 AbstractCegarLoop]: Abstraction has 1379 states and 3309 transitions. [2019-11-15 20:45:40,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 3309 transitions. [2019-11-15 20:45:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:40,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:40,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:40,237 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1985727126, now seen corresponding path program 2 times [2019-11-15 20:45:40,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:40,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129174090] [2019-11-15 20:45:40,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:40,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:40,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129174090] [2019-11-15 20:45:40,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:40,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 20:45:40,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114117430] [2019-11-15 20:45:40,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 20:45:40,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:45:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:45:40,479 INFO L87 Difference]: Start difference. First operand 1379 states and 3309 transitions. Second operand 11 states. [2019-11-15 20:45:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:40,850 INFO L93 Difference]: Finished difference Result 2516 states and 6121 transitions. [2019-11-15 20:45:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:45:40,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-11-15 20:45:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:40,853 INFO L225 Difference]: With dead ends: 2516 [2019-11-15 20:45:40,854 INFO L226 Difference]: Without dead ends: 1877 [2019-11-15 20:45:40,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:45:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-11-15 20:45:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1769. [2019-11-15 20:45:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-11-15 20:45:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 4177 transitions. [2019-11-15 20:45:40,882 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 4177 transitions. Word has length 93 [2019-11-15 20:45:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:40,882 INFO L462 AbstractCegarLoop]: Abstraction has 1769 states and 4177 transitions. [2019-11-15 20:45:40,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 20:45:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 4177 transitions. [2019-11-15 20:45:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:45:40,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:40,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:40,886 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:40,886 INFO L82 PathProgramCache]: Analyzing trace with hash 83007738, now seen corresponding path program 3 times [2019-11-15 20:45:40,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:40,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945296743] [2019-11-15 20:45:40,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:40,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:40,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:41,024 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:41,024 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:45:41,228 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:45:41,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:45:41 BasicIcfg [2019-11-15 20:45:41,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:45:41,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:45:41,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:45:41,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:45:41,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:49" (3/4) ... [2019-11-15 20:45:41,249 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:45:41,449 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e93e6512-6ae9-4072-aba1-3788254c16d0/bin/uautomizer/witness.graphml [2019-11-15 20:45:41,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:45:41,452 INFO L168 Benchmark]: Toolchain (without parser) took 53679.71 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 939.4 MB in the beginning and 1.6 GB in the end (delta: -620.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,453 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:45:41,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 881.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,454 INFO L168 Benchmark]: Boogie Preprocessor took 45.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:45:41,454 INFO L168 Benchmark]: RCFGBuilder took 1170.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,455 INFO L168 Benchmark]: TraceAbstraction took 51283.73 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -573.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,456 INFO L168 Benchmark]: Witness Printer took 208.66 ms. Allocated memory is still 4.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 74.8 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:41,460 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 881.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1170.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51283.73 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -573.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 208.66 ms. Allocated memory is still 4.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 74.8 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L700] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L701] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L702] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L703] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L704] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L705] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L706] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L707] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L708] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L709] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L710] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L711] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L712] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L713] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L714] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1 = y$w_buff0 [L721] 1 y$w_buff0 = 2 [L722] 1 y$w_buff1_used = y$w_buff0_used [L723] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y = y$flush_delayed ? y$mem_tmp : y [L805] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 174 locations, 3 error locations. Result: UNSAFE, OverallTime: 51.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8357 SDtfs, 8896 SDslu, 20281 SDs, 0 SdLazy, 9368 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 90 SyntacticMatches, 17 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76084occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 118039 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2390 NumberOfCodeBlocks, 2390 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2266 ConstructedInterpolants, 0 QuantifiedInterpolants, 392000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...