./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c --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_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/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 ca7b987059c829f244238d9119096032ac44debc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/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 ca7b987059c829f244238d9119096032ac44debc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:25:01,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:25:01,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:25:01,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:25:01,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:25:01,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:25:01,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:25:01,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:25:01,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:25:01,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:25:01,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:25:01,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:25:01,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:25:01,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:25:01,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:25:01,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:25:01,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:25:01,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:25:01,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:25:01,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:25:01,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:25:01,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:25:01,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:25:01,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:25:01,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:25:01,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:25:01,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:25:01,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:25:01,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:25:01,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:25:01,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:25:01,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:25:01,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:25:01,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:25:01,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:25:01,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:25:01,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:25:01,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:25:01,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:25:01,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:25:01,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:25:01,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:25:01,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:25:01,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:25:01,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:25:01,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:25:01,689 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:25:01,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:25:01,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:25:01,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:25:01,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:25:01,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:25:01,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:25:01,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:25:01,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:25:01,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:25:01,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:25:01,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:25:01,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:25:01,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:25:01,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:25:01,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:25:01,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:25:01,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:25:01,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:25:01,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:25:01,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:25:01,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:25:01,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:25:01,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:25:01,696 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_7d60044c-6651-458e-bcd1-9be99833fe9c/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-11-15 22:25:01,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:25:01,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:25:01,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:25:01,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:25:01,742 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:25:01,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:01,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/5a6aed0df/d9a3115e2b4248c8bc2d626b34f5e898/FLAG86e57bdd6 [2019-11-15 22:25:02,327 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:25:02,328 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:02,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/5a6aed0df/d9a3115e2b4248c8bc2d626b34f5e898/FLAG86e57bdd6 [2019-11-15 22:25:02,559 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/5a6aed0df/d9a3115e2b4248c8bc2d626b34f5e898 [2019-11-15 22:25:02,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:25:02,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:25:02,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:02,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:25:02,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:25:02,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:02" (1/1) ... [2019-11-15 22:25:02,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55228500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:02, skipping insertion in model container [2019-11-15 22:25:02,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:02" (1/1) ... [2019-11-15 22:25:02,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:25:02,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:25:03,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:03,148 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:25:03,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:03,282 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:25:03,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03 WrapperNode [2019-11-15 22:25:03,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:03,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:03,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:25:03,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:25:03,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:03,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:25:03,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:25:03,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:25:03,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... [2019-11-15 22:25:03,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:25:03,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:25:03,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:25:03,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:25:03,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/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 22:25:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:25:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:25:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:25:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:25:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:25:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:25:03,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:25:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:25:03,905 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:25:04,828 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:25:04,828 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:25:04,830 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:25:04,830 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:25:04,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:04 BoogieIcfgContainer [2019-11-15 22:25:04,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:25:04,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:25:04,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:25:04,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:25:04,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:25:02" (1/3) ... [2019-11-15 22:25:04,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b6dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:04, skipping insertion in model container [2019-11-15 22:25:04,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:03" (2/3) ... [2019-11-15 22:25:04,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b6dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:04, skipping insertion in model container [2019-11-15 22:25:04,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:04" (3/3) ... [2019-11-15 22:25:04,849 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:04,859 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:25:04,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:25:04,880 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:25:04,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:25:04,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:25:04,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:25:04,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:25:04,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:25:04,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:25:04,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:25:04,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:25:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:25:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:25:04,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:04,932 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] [2019-11-15 22:25:04,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 22:25:04,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:04,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956732748] [2019-11-15 22:25:04,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:04,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:04,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:05,229 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 22:25:05,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956732748] [2019-11-15 22:25:05,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:05,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:05,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427994354] [2019-11-15 22:25:05,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:05,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:05,254 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:25:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:05,869 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 22:25:05,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:05,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:25:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:05,897 INFO L225 Difference]: With dead ends: 323 [2019-11-15 22:25:05,898 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:25:05,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:25:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:25:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 22:25:05,979 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 22:25:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:05,979 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 22:25:05,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 22:25:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:05,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:05,985 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:05,985 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-15 22:25:05,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:05,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555806432] [2019-11-15 22:25:05,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:05,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:05,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:06,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555806432] [2019-11-15 22:25:06,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:06,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:06,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030871785] [2019-11-15 22:25:06,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:06,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:06,179 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 22:25:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:06,585 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 22:25:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:06,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 22:25:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:06,588 INFO L225 Difference]: With dead ends: 290 [2019-11-15 22:25:06,588 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:25:06,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:25:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:25:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 22:25:06,618 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 22:25:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:06,619 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 22:25:06,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 22:25:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:06,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:06,624 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:06,624 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-15 22:25:06,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:06,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248647909] [2019-11-15 22:25:06,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:06,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:06,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:06,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248647909] [2019-11-15 22:25:06,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:06,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:06,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614427384] [2019-11-15 22:25:06,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:06,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:06,851 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 22:25:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:07,261 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 22:25:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:07,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:25:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:07,264 INFO L225 Difference]: With dead ends: 289 [2019-11-15 22:25:07,264 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 22:25:07,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 22:25:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 22:25:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 22:25:07,275 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 22:25:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:07,275 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 22:25:07,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 22:25:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:07,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:07,278 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:07,278 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-15 22:25:07,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:07,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291599686] [2019-11-15 22:25:07,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:07,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:07,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:07,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291599686] [2019-11-15 22:25:07,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:07,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:07,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583234829] [2019-11-15 22:25:07,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:07,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:07,355 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 22:25:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:07,718 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 22:25:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:07,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:25:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:07,721 INFO L225 Difference]: With dead ends: 287 [2019-11-15 22:25:07,721 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:25:07,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:25:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 22:25:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 22:25:07,732 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 22:25:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:07,732 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 22:25:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 22:25:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:07,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:07,735 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 22:25:07,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-15 22:25:07,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:07,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196165321] [2019-11-15 22:25:07,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:07,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:07,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:07,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196165321] [2019-11-15 22:25:07,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:07,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:07,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611329301] [2019-11-15 22:25:07,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:07,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:07,805 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 22:25:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:08,105 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 22:25:08,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:08,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:25:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:08,107 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:25:08,107 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:25:08,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:25:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:25:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 22:25:08,115 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 22:25:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:08,115 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 22:25:08,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 22:25:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:08,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:08,117 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:08,117 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-15 22:25:08,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:08,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141737150] [2019-11-15 22:25:08,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:08,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141737150] [2019-11-15 22:25:08,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:08,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:08,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751709502] [2019-11-15 22:25:08,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:08,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:08,223 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 22:25:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:08,529 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 22:25:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:08,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:25:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:08,535 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:25:08,535 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:25:08,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:25:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:25:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 22:25:08,542 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 22:25:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:08,542 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 22:25:08,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 22:25:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:25:08,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:08,543 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:08,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-15 22:25:08,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:08,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080481657] [2019-11-15 22:25:08,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:08,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080481657] [2019-11-15 22:25:08,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:08,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:08,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409249074] [2019-11-15 22:25:08,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:08,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:08,617 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 22:25:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:08,903 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 22:25:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:08,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 22:25:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:08,905 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:25:08,905 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:25:08,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:25:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:25:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 22:25:08,909 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 22:25:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:08,910 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 22:25:08,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 22:25:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:25:08,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:08,911 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:08,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-15 22:25:08,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:08,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777383767] [2019-11-15 22:25:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:08,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:08,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777383767] [2019-11-15 22:25:08,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:08,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:08,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297124204] [2019-11-15 22:25:08,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:08,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:08,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:08,962 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 22:25:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:09,295 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 22:25:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:09,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 22:25:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:09,297 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:25:09,297 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:25:09,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:25:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:25:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 22:25:09,303 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 22:25:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:09,303 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 22:25:09,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 22:25:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:25:09,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:09,304 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:09,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-15 22:25:09,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:09,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862128623] [2019-11-15 22:25:09,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:09,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862128623] [2019-11-15 22:25:09,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:09,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:09,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606891358] [2019-11-15 22:25:09,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:09,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:09,372 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 22:25:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:09,616 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 22:25:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:09,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:25:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:09,617 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:25:09,617 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:25:09,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:25:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 22:25:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:25:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 22:25:09,621 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 22:25:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:09,621 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 22:25:09,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 22:25:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:25:09,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:09,622 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:09,622 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-15 22:25:09,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:09,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295594734] [2019-11-15 22:25:09,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:09,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295594734] [2019-11-15 22:25:09,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:09,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:09,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705376617] [2019-11-15 22:25:09,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:09,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:09,675 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 22:25:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:09,977 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 22:25:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:09,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:25:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:09,979 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:25:09,979 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:25:09,979 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 22:25:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:25:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:25:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 22:25:09,985 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 22:25:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:09,986 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 22:25:09,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 22:25:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:25:09,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:09,987 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:09,987 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-15 22:25:09,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:09,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056772755] [2019-11-15 22:25:09,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:10,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056772755] [2019-11-15 22:25:10,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:10,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:10,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579211655] [2019-11-15 22:25:10,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:10,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:10,041 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 22:25:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:10,401 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 22:25:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:10,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 22:25:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:10,403 INFO L225 Difference]: With dead ends: 338 [2019-11-15 22:25:10,403 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:25:10,403 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 22:25:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:25:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:25:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 22:25:10,409 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 22:25:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:10,409 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 22:25:10,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 22:25:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:25:10,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:10,410 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:10,411 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-15 22:25:10,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:10,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193626818] [2019-11-15 22:25:10,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:10,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193626818] [2019-11-15 22:25:10,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:10,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:10,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266115369] [2019-11-15 22:25:10,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:10,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:10,471 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 22:25:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:10,886 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 22:25:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:10,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:25:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:10,889 INFO L225 Difference]: With dead ends: 337 [2019-11-15 22:25:10,889 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 22:25:10,889 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 22:25:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 22:25:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 22:25:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 22:25:10,895 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 22:25:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:10,895 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 22:25:10,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 22:25:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:25:10,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:10,898 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:10,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-15 22:25:10,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:10,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189539496] [2019-11-15 22:25:10,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:10,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189539496] [2019-11-15 22:25:10,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:10,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:10,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511223467] [2019-11-15 22:25:10,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:10,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:10,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:10,962 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 22:25:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:11,361 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 22:25:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:11,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:25:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:11,363 INFO L225 Difference]: With dead ends: 335 [2019-11-15 22:25:11,363 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:25:11,364 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 22:25:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:25:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 22:25:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 22:25:11,370 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 22:25:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:11,370 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 22:25:11,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 22:25:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:25:11,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:11,372 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 22:25:11,372 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-15 22:25:11,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:11,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500359905] [2019-11-15 22:25:11,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:11,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500359905] [2019-11-15 22:25:11,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:11,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:11,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914208498] [2019-11-15 22:25:11,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:11,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:11,439 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 22:25:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:11,863 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 22:25:11,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:11,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:25:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:11,865 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:25:11,866 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:25:11,866 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 22:25:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:25:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:25:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 22:25:11,872 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 22:25:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:11,872 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 22:25:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 22:25:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:25:11,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:11,873 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:11,873 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-15 22:25:11,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:11,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102945397] [2019-11-15 22:25:11,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:11,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102945397] [2019-11-15 22:25:11,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:11,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:11,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149116595] [2019-11-15 22:25:11,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:11,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:11,955 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 22:25:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:12,340 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 22:25:12,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:12,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:25:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:12,342 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:25:12,342 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:25:12,343 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 22:25:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:25:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:25:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 22:25:12,352 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 22:25:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:12,352 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 22:25:12,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 22:25:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:12,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:12,353 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:12,354 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-15 22:25:12,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:12,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054119396] [2019-11-15 22:25:12,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:12,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:12,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054119396] [2019-11-15 22:25:12,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:12,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:12,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237291664] [2019-11-15 22:25:12,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:12,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:12,400 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 22:25:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:12,765 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 22:25:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:12,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:25:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:12,767 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:25:12,767 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:25:12,767 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 22:25:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:25:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:25:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 22:25:12,772 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 22:25:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:12,774 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 22:25:12,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 22:25:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:25:12,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:12,775 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:12,776 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-15 22:25:12,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:12,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127243415] [2019-11-15 22:25:12,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:12,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:12,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127243415] [2019-11-15 22:25:12,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:12,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:12,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801453136] [2019-11-15 22:25:12,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:12,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:12,830 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 22:25:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:13,231 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 22:25:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:13,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:25:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:13,233 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:25:13,233 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:25:13,233 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 22:25:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:25:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:25:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 22:25:13,240 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 22:25:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:13,240 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 22:25:13,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 22:25:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 22:25:13,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:13,242 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:13,242 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:13,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-15 22:25:13,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:13,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027755816] [2019-11-15 22:25:13,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:13,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:13,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:13,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027755816] [2019-11-15 22:25:13,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:13,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:13,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199883003] [2019-11-15 22:25:13,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:13,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:13,294 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 22:25:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:13,623 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 22:25:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:13,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 22:25:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:13,625 INFO L225 Difference]: With dead ends: 324 [2019-11-15 22:25:13,625 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:25:13,625 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 22:25:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:25:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 22:25:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:25:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 22:25:13,632 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 22:25:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:13,632 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 22:25:13,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 22:25:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:25:13,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:13,633 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:13,634 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-15 22:25:13,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:13,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570876739] [2019-11-15 22:25:13,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:13,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:13,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:13,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570876739] [2019-11-15 22:25:13,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:13,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:13,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632734354] [2019-11-15 22:25:13,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:13,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:13,702 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 22:25:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:14,259 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-15 22:25:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:14,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:25:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:14,262 INFO L225 Difference]: With dead ends: 424 [2019-11-15 22:25:14,262 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 22:25:14,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 22:25:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-15 22:25:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 22:25:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 22:25:14,272 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 22:25:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:14,273 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 22:25:14,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 22:25:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:25:14,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:14,274 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:14,274 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-15 22:25:14,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:14,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061936894] [2019-11-15 22:25:14,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:14,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061936894] [2019-11-15 22:25:14,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:14,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:14,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654763579] [2019-11-15 22:25:14,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:14,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:14,356 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 22:25:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:14,844 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 22:25:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:14,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:25:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:14,846 INFO L225 Difference]: With dead ends: 427 [2019-11-15 22:25:14,846 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 22:25:14,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 22:25:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 22:25:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 22:25:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 22:25:14,853 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 22:25:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:14,854 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 22:25:14,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 22:25:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:25:14,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:14,855 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:14,855 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-15 22:25:14,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:14,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481947471] [2019-11-15 22:25:14,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:14,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481947471] [2019-11-15 22:25:14,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:14,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:14,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409376233] [2019-11-15 22:25:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:14,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:14,924 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 22:25:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:15,352 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-15 22:25:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:15,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:25:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:15,355 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:25:15,355 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:25:15,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:25:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-15 22:25:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 22:25:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 22:25:15,364 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 22:25:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:15,365 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 22:25:15,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 22:25:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:25:15,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:15,366 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:15,366 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2019-11-15 22:25:15,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:15,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622883938] [2019-11-15 22:25:15,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:15,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622883938] [2019-11-15 22:25:15,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:15,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:15,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948772340] [2019-11-15 22:25:15,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:15,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:15,440 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 22:25:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:15,810 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-15 22:25:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:15,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 22:25:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:15,817 INFO L225 Difference]: With dead ends: 495 [2019-11-15 22:25:15,817 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:25:15,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:25:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-15 22:25:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 22:25:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 22:25:15,826 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2019-11-15 22:25:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:15,826 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 22:25:15,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 22:25:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:25:15,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:15,828 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:15,828 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2019-11-15 22:25:15,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:15,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669064615] [2019-11-15 22:25:15,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:15,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669064615] [2019-11-15 22:25:15,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:15,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:15,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795842033] [2019-11-15 22:25:15,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:15,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:15,902 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 22:25:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,370 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-15 22:25:16,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:16,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 22:25:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,372 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:25:16,373 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:25:16,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:25:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 22:25:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 22:25:16,380 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2019-11-15 22:25:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 22:25:16,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 22:25:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:25:16,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,382 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:16,383 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-15 22:25:16,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426197965] [2019-11-15 22:25:16,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:16,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426197965] [2019-11-15 22:25:16,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:16,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750262506] [2019-11-15 22:25:16,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:16,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:16,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:16,452 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 22:25:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,858 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-15 22:25:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:16,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:25:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,860 INFO L225 Difference]: With dead ends: 498 [2019-11-15 22:25:16,860 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:25:16,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:25:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 22:25:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 22:25:16,868 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 22:25:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,868 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 22:25:16,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 22:25:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:25:16,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,869 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:16,869 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-15 22:25:16,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549256341] [2019-11-15 22:25:16,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:16,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549256341] [2019-11-15 22:25:16,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:16,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897409112] [2019-11-15 22:25:16,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:16,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:16,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:16,930 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 22:25:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,227 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 22:25:17,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:17,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:25:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,229 INFO L225 Difference]: With dead ends: 475 [2019-11-15 22:25:17,229 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 22:25:17,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 22:25:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 22:25:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 22:25:17,235 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 22:25:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 22:25:17,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 22:25:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:17,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,237 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:17,237 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-15 22:25:17,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950190934] [2019-11-15 22:25:17,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:17,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950190934] [2019-11-15 22:25:17,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:17,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051774122] [2019-11-15 22:25:17,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:17,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:17,331 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 22:25:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,784 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 22:25:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:17,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:25:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,786 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:25:17,786 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:25:17,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:25:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 22:25:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 22:25:17,793 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 22:25:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,793 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 22:25:17,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 22:25:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:17,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,794 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:17,795 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-15 22:25:17,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100165438] [2019-11-15 22:25:17,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:17,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100165438] [2019-11-15 22:25:17,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:17,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748181475] [2019-11-15 22:25:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:17,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:17,848 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 22:25:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,266 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-15 22:25:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:18,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:25:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,269 INFO L225 Difference]: With dead ends: 495 [2019-11-15 22:25:18,269 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 22:25:18,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 22:25:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-15 22:25:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 22:25:18,275 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 22:25:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,275 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 22:25:18,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 22:25:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:18,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,276 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:18,277 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-15 22:25:18,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395966243] [2019-11-15 22:25:18,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:18,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395966243] [2019-11-15 22:25:18,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:18,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219680922] [2019-11-15 22:25:18,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:18,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:18,361 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 22:25:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,749 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-15 22:25:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:18,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:25:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,751 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:25:18,751 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 22:25:18,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 22:25:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-15 22:25:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:25:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 22:25:18,758 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 22:25:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,758 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 22:25:18,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 22:25:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:18,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,759 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:18,759 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-15 22:25:18,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112830700] [2019-11-15 22:25:18,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:25:18,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112830700] [2019-11-15 22:25:18,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:25:18,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440884185] [2019-11-15 22:25:18,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:25:18,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:25:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:25:18,836 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 22:25:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:19,360 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 22:25:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:25:19,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 22:25:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:19,363 INFO L225 Difference]: With dead ends: 470 [2019-11-15 22:25:19,363 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 22:25:19,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 22:25:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 22:25:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 22:25:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 22:25:19,370 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 22:25:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 22:25:19,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:25:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 22:25:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:19,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:19,371 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:19,371 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-15 22:25:19,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530436631] [2019-11-15 22:25:19,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:19,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530436631] [2019-11-15 22:25:19,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:19,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:19,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038184624] [2019-11-15 22:25:19,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:19,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:19,425 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 22:25:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:19,797 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 22:25:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:19,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:25:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:19,800 INFO L225 Difference]: With dead ends: 512 [2019-11-15 22:25:19,800 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 22:25:19,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 22:25:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 22:25:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 22:25:19,807 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 22:25:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:19,807 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 22:25:19,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 22:25:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:25:19,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:19,809 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:19,809 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-15 22:25:19,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487618445] [2019-11-15 22:25:19,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:19,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487618445] [2019-11-15 22:25:19,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:19,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:19,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868630517] [2019-11-15 22:25:19,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:19,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:19,869 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 22:25:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:20,239 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 22:25:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:20,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:25:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:20,242 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:25:20,242 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:25:20,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:25:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:25:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 22:25:20,251 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 22:25:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:20,251 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 22:25:20,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 22:25:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:25:20,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:20,253 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:20,253 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-15 22:25:20,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:20,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704698779] [2019-11-15 22:25:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:20,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704698779] [2019-11-15 22:25:20,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:20,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:20,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028294835] [2019-11-15 22:25:20,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:20,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:20,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:20,331 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 22:25:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:20,738 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-15 22:25:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:20,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:25:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:20,740 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:25:20,740 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:25:20,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:25:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:25:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 22:25:20,749 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 22:25:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:20,749 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 22:25:20,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 22:25:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:25:20,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:20,751 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:20,751 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-15 22:25:20,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:20,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743888840] [2019-11-15 22:25:20,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:20,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743888840] [2019-11-15 22:25:20,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:20,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:20,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036595483] [2019-11-15 22:25:20,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:20,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:20,813 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 22:25:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,121 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 22:25:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:21,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:25:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:21,125 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:25:21,126 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:25:21,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:25:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:25:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 22:25:21,132 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 22:25:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:21,133 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 22:25:21,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 22:25:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:25:21,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:21,134 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:21,134 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-15 22:25:21,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:21,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940251952] [2019-11-15 22:25:21,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:21,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940251952] [2019-11-15 22:25:21,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:21,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:21,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077590082] [2019-11-15 22:25:21,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:21,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:21,200 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 22:25:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,564 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-15 22:25:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:21,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:25:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:21,567 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:25:21,567 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:25:21,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:25:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:25:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 22:25:21,575 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 22:25:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:21,575 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 22:25:21,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 22:25:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:25:21,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:21,576 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:21,577 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-15 22:25:21,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:21,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935696813] [2019-11-15 22:25:21,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:21,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935696813] [2019-11-15 22:25:21,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:21,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:21,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956121953] [2019-11-15 22:25:21,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:21,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:21,634 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 22:25:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,939 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 22:25:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:21,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:25:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:21,942 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:25:21,942 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:25:21,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:25:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:25:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 22:25:21,949 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 22:25:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:21,949 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 22:25:21,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 22:25:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:25:21,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:21,951 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:21,951 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-15 22:25:21,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:21,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525687099] [2019-11-15 22:25:21,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:21,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525687099] [2019-11-15 22:25:22,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:22,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:22,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742825399] [2019-11-15 22:25:22,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:22,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:22,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:22,002 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 22:25:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:22,433 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-15 22:25:22,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:22,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:25:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:22,435 INFO L225 Difference]: With dead ends: 534 [2019-11-15 22:25:22,435 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 22:25:22,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 22:25:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 22:25:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 22:25:22,443 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 22:25:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:22,443 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 22:25:22,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 22:25:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:25:22,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:22,444 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:22,445 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-15 22:25:22,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:22,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322557322] [2019-11-15 22:25:22,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:22,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322557322] [2019-11-15 22:25:22,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:22,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:22,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767256754] [2019-11-15 22:25:22,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:22,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:22,508 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 22:25:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:22,842 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 22:25:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:22,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:25:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:22,844 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:25:22,844 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:25:22,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:25:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:25:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 22:25:22,851 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 22:25:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:22,852 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 22:25:22,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 22:25:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:25:22,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:22,853 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:22,853 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-15 22:25:22,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:22,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791784484] [2019-11-15 22:25:22,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:22,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791784484] [2019-11-15 22:25:22,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:22,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:22,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540530768] [2019-11-15 22:25:22,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:22,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:22,922 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 22:25:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:23,296 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-15 22:25:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:23,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:25:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:23,298 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:25:23,298 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:25:23,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:25:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 22:25:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 22:25:23,308 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 22:25:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,308 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 22:25:23,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 22:25:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:25:23,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,310 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:23,310 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-15 22:25:23,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116706375] [2019-11-15 22:25:23,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:23,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116706375] [2019-11-15 22:25:23,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:23,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:23,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331255878] [2019-11-15 22:25:23,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:23,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:23,407 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 22:25:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:23,707 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 22:25:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:23,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:25:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:23,709 INFO L225 Difference]: With dead ends: 501 [2019-11-15 22:25:23,710 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 22:25:23,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 22:25:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 22:25:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 22:25:23,719 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 22:25:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 22:25:23,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 22:25:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:25:23,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,721 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:23,721 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-15 22:25:23,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592710185] [2019-11-15 22:25:23,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:23,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592710185] [2019-11-15 22:25:23,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:23,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:23,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655756570] [2019-11-15 22:25:23,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:23,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:23,774 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 22:25:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,185 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-15 22:25:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:24,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:25:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,188 INFO L225 Difference]: With dead ends: 524 [2019-11-15 22:25:24,188 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 22:25:24,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 22:25:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 22:25:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:25:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 22:25:24,196 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 22:25:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,196 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 22:25:24,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 22:25:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:25:24,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,198 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:24,198 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-15 22:25:24,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571123725] [2019-11-15 22:25:24,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:25:24,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571123725] [2019-11-15 22:25:24,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980954355] [2019-11-15 22:25:24,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,250 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 22:25:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,300 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 22:25:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:25:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,304 INFO L225 Difference]: With dead ends: 722 [2019-11-15 22:25:24,304 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 22:25:24,304 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 22:25:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 22:25:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 22:25:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 22:25:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 22:25:24,320 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 22:25:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,320 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 22:25:24,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 22:25:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:25:24,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,322 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:24,322 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-15 22:25:24,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173070560] [2019-11-15 22:25:24,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:25:24,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173070560] [2019-11-15 22:25:24,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886650017] [2019-11-15 22:25:24,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,374 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 22:25:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,434 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 22:25:24,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:25:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,439 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 22:25:24,439 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 22:25:24,440 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 22:25:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 22:25:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 22:25:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 22:25:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 22:25:24,460 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 22:25:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,461 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 22:25:24,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 22:25:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:25:24,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,463 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:24,463 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2019-11-15 22:25:24,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562219167] [2019-11-15 22:25:24,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:25:24,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562219167] [2019-11-15 22:25:24,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969527659] [2019-11-15 22:25:24,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,525 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 22:25:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,617 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 22:25:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:25:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,622 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 22:25:24,622 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 22:25:24,623 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 22:25:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 22:25:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 22:25:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 22:25:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 22:25:24,651 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 105 [2019-11-15 22:25:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,652 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 22:25:24,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 22:25:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 22:25:24,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,655 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 22:25:24,655 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2019-11-15 22:25:24,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154947114] [2019-11-15 22:25:24,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:25:24,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154947114] [2019-11-15 22:25:24,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040623251] [2019-11-15 22:25:24,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,718 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 22:25:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,785 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 22:25:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 22:25:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,791 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 22:25:24,792 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 22:25:24,793 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 22:25:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 22:25:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 22:25:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 22:25:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 22:25:24,825 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 122 [2019-11-15 22:25:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,825 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 22:25:24,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 22:25:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:25:24,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,828 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:24,829 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,829 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-15 22:25:24,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797662301] [2019-11-15 22:25:24,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:25:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:25:25,211 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:25:25,211 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:25:25,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:25:25 BoogieIcfgContainer [2019-11-15 22:25:25,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:25:25,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:25:25,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:25:25,358 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:25:25,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:04" (3/4) ... [2019-11-15 22:25:25,362 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:25:25,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:25:25,364 INFO L168 Benchmark]: Toolchain (without parser) took 22786.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 939.2 MB in the beginning and 906.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 382.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:25,364 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:25,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:25,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.66 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 22:25:25,366 INFO L168 Benchmark]: Boogie Preprocessor took 116.80 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:25,366 INFO L168 Benchmark]: RCFGBuilder took 1323.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:25,367 INFO L168 Benchmark]: TraceAbstraction took 20519.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.0 GB in the beginning and 906.6 MB in the end (delta: 98.1 MB). Peak memory consumption was 306.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:25,367 INFO L168 Benchmark]: Witness Printer took 4.73 ms. Allocated memory is still 1.4 GB. Free memory is still 906.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:25,369 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.66 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. * Boogie Preprocessor took 116.80 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1323.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20519.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 1.0 GB in the beginning and 906.6 MB in the end (delta: 98.1 MB). Peak memory consumption was 306.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.73 ms. Allocated memory is still 1.4 GB. Free memory is still 906.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-3:0}] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [init=1, SSLv3_server_data={-3:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-3:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [init=1, SSLv3_server_data={-3:0}] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={-3:0}] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [init=1, SSLv3_server_data={-3:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-3:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={-3:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={-3:0}] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-3:0}] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={-3:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 20.4s, OverallIterations: 45, TraceHistogramMax: 5, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8837 SDtfs, 2842 SDslu, 12160 SDs, 0 SdLazy, 7532 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 96 SyntacticMatches, 36 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1186occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 44 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3302 ConstructedInterpolants, 0 QuantifiedInterpolants, 781706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 1954/1954 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:25:27,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:25:27,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:25:27,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:25:27,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:25:27,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:25:27,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:25:27,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:25:27,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:25:27,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:25:27,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:25:27,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:25:27,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:25:27,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:25:27,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:25:27,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:25:27,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:25:27,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:25:27,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:25:27,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:25:27,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:25:27,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:25:27,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:25:27,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:25:27,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:25:27,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:25:27,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:25:27,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:25:27,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:25:27,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:25:27,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:25:27,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:25:27,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:25:27,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:25:27,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:25:27,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:25:27,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:25:27,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:25:27,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:25:27,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:25:27,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:25:27,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:25:27,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:25:27,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:25:27,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:25:27,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:25:27,836 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:25:27,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:25:27,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:25:27,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:25:27,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:25:27,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:25:27,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:25:27,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:25:27,839 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:25:27,839 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:25:27,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:25:27,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:25:27,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:25:27,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:25:27,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:25:27,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:25:27,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:25:27,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:25:27,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:25:27,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:25:27,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:25:27,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:25:27,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:25:27,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:25:27,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:25:27,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:25:27,844 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_7d60044c-6651-458e-bcd1-9be99833fe9c/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-11-15 22:25:27,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:25:27,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:25:27,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:25:27,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:25:27,898 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:25:27,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:27,969 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/b3bf567dc/954bbe3d4a2d4f4fad8122e17d6eae10/FLAGfd14ccf53 [2019-11-15 22:25:28,547 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:25:28,548 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:28,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/b3bf567dc/954bbe3d4a2d4f4fad8122e17d6eae10/FLAGfd14ccf53 [2019-11-15 22:25:28,723 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/data/b3bf567dc/954bbe3d4a2d4f4fad8122e17d6eae10 [2019-11-15 22:25:28,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:25:28,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:25:28,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:28,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:25:28,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:25:28,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:28" (1/1) ... [2019-11-15 22:25:28,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34da0011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:28, skipping insertion in model container [2019-11-15 22:25:28,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:28" (1/1) ... [2019-11-15 22:25:28,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:25:28,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:25:29,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:29,405 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:25:29,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:29,590 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:25:29,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29 WrapperNode [2019-11-15 22:25:29,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:29,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:29,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:25:29,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:25:29,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:29,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:25:29,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:25:29,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:25:29,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... [2019-11-15 22:25:29,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:25:29,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:25:29,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:25:29,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:25:29,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/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 22:25:29,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:25:29,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:25:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:25:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:25:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:25:29,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:25:29,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:25:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:25:30,103 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:25:32,789 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:25:32,789 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:25:32,792 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:25:32,792 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:25:32,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:32 BoogieIcfgContainer [2019-11-15 22:25:32,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:25:32,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:25:32,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:25:32,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:25:32,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:25:28" (1/3) ... [2019-11-15 22:25:32,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e3ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:32, skipping insertion in model container [2019-11-15 22:25:32,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:29" (2/3) ... [2019-11-15 22:25:32,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e3ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:32, skipping insertion in model container [2019-11-15 22:25:32,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:32" (3/3) ... [2019-11-15 22:25:32,804 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-11-15 22:25:32,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:25:32,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:25:32,831 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:25:32,853 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:25:32,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:25:32,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:25:32,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:25:32,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:25:32,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:25:32,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:25:32,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:25:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:25:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:25:32,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:32,883 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] [2019-11-15 22:25:32,884 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 22:25:32,900 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:32,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [476862546] [2019-11-15 22:25:32,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:33,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:33,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:33,174 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 22:25:33,174 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:25:33,211 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 22:25:33,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [476862546] [2019-11-15 22:25:33,213 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:33,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:25:33,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000273348] [2019-11-15 22:25:33,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:33,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:25:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:33,236 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:25:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:33,437 INFO L93 Difference]: Finished difference Result 561 states and 957 transitions. [2019-11-15 22:25:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:33,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:25:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:33,456 INFO L225 Difference]: With dead ends: 561 [2019-11-15 22:25:33,457 INFO L226 Difference]: Without dead ends: 382 [2019-11-15 22:25:33,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-15 22:25:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-11-15 22:25:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-15 22:25:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2019-11-15 22:25:33,571 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 35 [2019-11-15 22:25:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:33,572 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2019-11-15 22:25:33,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2019-11-15 22:25:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:25:33,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:33,586 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:33,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:33,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1192573563, now seen corresponding path program 1 times [2019-11-15 22:25:33,791 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:33,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1760331281] [2019-11-15 22:25:33,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:34,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:34,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:34,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:25:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:25:34,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1760331281] [2019-11-15 22:25:34,070 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:34,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:25:34,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082379388] [2019-11-15 22:25:34,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:34,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:25:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:34,074 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand 4 states. [2019-11-15 22:25:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:36,226 INFO L93 Difference]: Finished difference Result 876 states and 1345 transitions. [2019-11-15 22:25:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:36,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:25:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:36,234 INFO L225 Difference]: With dead ends: 876 [2019-11-15 22:25:36,234 INFO L226 Difference]: Without dead ends: 628 [2019-11-15 22:25:36,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-15 22:25:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-15 22:25:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-15 22:25:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 950 transitions. [2019-11-15 22:25:36,302 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 950 transitions. Word has length 59 [2019-11-15 22:25:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:36,303 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 950 transitions. [2019-11-15 22:25:36,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 950 transitions. [2019-11-15 22:25:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:25:36,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:36,312 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:36,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:36,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1680839393, now seen corresponding path program 1 times [2019-11-15 22:25:36,517 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:36,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [826714670] [2019-11-15 22:25:36,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:36,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:36,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:36,840 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:25:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:25:36,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [826714670] [2019-11-15 22:25:36,894 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:36,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:25:36,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2166559] [2019-11-15 22:25:36,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:36,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:25:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:36,898 INFO L87 Difference]: Start difference. First operand 626 states and 950 transitions. Second operand 4 states. [2019-11-15 22:25:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:37,443 INFO L93 Difference]: Finished difference Result 1366 states and 2085 transitions. [2019-11-15 22:25:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:37,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 22:25:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:37,449 INFO L225 Difference]: With dead ends: 1366 [2019-11-15 22:25:37,449 INFO L226 Difference]: Without dead ends: 872 [2019-11-15 22:25:37,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-15 22:25:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-11-15 22:25:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-15 22:25:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1320 transitions. [2019-11-15 22:25:37,490 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1320 transitions. Word has length 103 [2019-11-15 22:25:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1320 transitions. [2019-11-15 22:25:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1320 transitions. [2019-11-15 22:25:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:25:37,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:37,495 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:37,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:37,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1159018067, now seen corresponding path program 1 times [2019-11-15 22:25:37,699 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:37,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1519767122] [2019-11-15 22:25:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:40,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:25:40,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:41,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:25:41,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:41,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 22:25:41,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:41,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 22:25:41,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:41,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:25:41,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:41,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:25:41,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:41,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:41,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:25:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 22:25:41,158 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:25:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 22:25:41,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1519767122] [2019-11-15 22:25:41,223 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:41,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 22:25:41,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739753642] [2019-11-15 22:25:41,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:25:41,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:25:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:25:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:25:41,225 INFO L87 Difference]: Start difference. First operand 872 states and 1320 transitions. Second operand 8 states. [2019-11-15 22:25:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:55,089 INFO L93 Difference]: Finished difference Result 3288 states and 4998 transitions. [2019-11-15 22:25:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:55,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-11-15 22:25:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:55,104 INFO L225 Difference]: With dead ends: 3288 [2019-11-15 22:25:55,104 INFO L226 Difference]: Without dead ends: 2424 [2019-11-15 22:25:55,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:25:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-11-15 22:25:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1046. [2019-11-15 22:25:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-11-15 22:25:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1620 transitions. [2019-11-15 22:25:55,177 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1620 transitions. Word has length 127 [2019-11-15 22:25:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:55,178 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1620 transitions. [2019-11-15 22:25:55,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:25:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1620 transitions. [2019-11-15 22:25:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:25:55,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:55,181 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:25:55,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:55,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-15 22:25:55,405 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:25:55,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [940339381] [2019-11-15 22:25:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:25:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:03,455 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 22:26:03,455 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:26:03,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:26:03,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:26:03 BoogieIcfgContainer [2019-11-15 22:26:03,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:26:03,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:26:03,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:26:03,850 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:26:03,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:32" (3/4) ... [2019-11-15 22:26:03,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:26:04,010 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d60044c-6651-458e-bcd1-9be99833fe9c/bin/uautomizer/witness.graphml [2019-11-15 22:26:04,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:26:04,011 INFO L168 Benchmark]: Toolchain (without parser) took 35282.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -274.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,011 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:04,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.66 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,013 INFO L168 Benchmark]: Boogie Preprocessor took 114.21 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,013 INFO L168 Benchmark]: RCFGBuilder took 3004.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,013 INFO L168 Benchmark]: TraceAbstraction took 31054.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -207.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:04,014 INFO L168 Benchmark]: Witness Printer took 159.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:04,015 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 859.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.66 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.21 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3004.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31054.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -207.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 159.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-3:0}] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [init=1, SSLv3_server_data={-3:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-3:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [init=1, SSLv3_server_data={-3:0}] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={-3:0}] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [init=1, SSLv3_server_data={-3:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={-3:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={-3:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={-3:0}] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={-3:0}] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={-3:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 30.9s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1142 SDtfs, 1897 SDslu, 1743 SDs, 0 SdLazy, 896 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 197988 SizeOfPredicates, 8 NumberOfNonLiveVariables, 869 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 506/506 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...