./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.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/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c80528d715feba546d9b9f6f7af7c865965b863 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c80528d715feba546d9b9f6f7af7c865965b863 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-10-22 11:27:31,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:31,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:31,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:31,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:31,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:31,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:31,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:31,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:31,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:31,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:31,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:31,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:31,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:31,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:31,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:31,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:31,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:31,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:31,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:31,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:31,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:31,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:31,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:31,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:31,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:31,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:31,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:31,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:31,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:31,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:31,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:31,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:31,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:31,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:31,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:31,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:31,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:31,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:31,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:31,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:31,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:31,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:31,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:31,858 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:31,858 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:31,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:31,858 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:31,859 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:31,859 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:31,859 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:31,859 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:31,859 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:31,860 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:31,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:31,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:31,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:31,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:31,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:31,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:31,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:31,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:31,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:31,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:31,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:31,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:31,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:31,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:31,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:31,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:31,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:31,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:31,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:31,865 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:31,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:31,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:31,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:31,866 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan 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 -> Taipan 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 -> 1c80528d715feba546d9b9f6f7af7c865965b863 [2019-10-22 11:27:31,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:31,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:31,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:31,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:31,930 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:31,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:31,987 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/edbb0ce74/3cc87c931840487fa363a7fcc2757c52/FLAGc3852b384 [2019-10-22 11:27:32,456 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:32,457 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:32,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/edbb0ce74/3cc87c931840487fa363a7fcc2757c52/FLAGc3852b384 [2019-10-22 11:27:32,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/edbb0ce74/3cc87c931840487fa363a7fcc2757c52 [2019-10-22 11:27:32,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:32,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:32,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:32,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:32,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:32,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:32" (1/1) ... [2019-10-22 11:27:32,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a78bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:32, skipping insertion in model container [2019-10-22 11:27:32,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:32" (1/1) ... [2019-10-22 11:27:32,810 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:32,866 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:33,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:33,289 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:33,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:33,425 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:33,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33 WrapperNode [2019-10-22 11:27:33,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:33,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:33,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:33,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:33,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:33,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:33,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:33,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:33,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... [2019-10-22 11:27:33,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:33,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:33,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:33,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:33,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/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-10-22 11:27:33,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:27:33,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:27:33,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:27:33,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:33,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:33,893 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:34,677 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 11:27:34,677 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 11:27:34,678 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:34,678 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:27:34,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:34 BoogieIcfgContainer [2019-10-22 11:27:34,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:34,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:34,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:34,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:34,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:32" (1/3) ... [2019-10-22 11:27:34,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a384dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:34, skipping insertion in model container [2019-10-22 11:27:34,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:33" (2/3) ... [2019-10-22 11:27:34,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a384dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:34, skipping insertion in model container [2019-10-22 11:27:34,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:34" (3/3) ... [2019-10-22 11:27:34,690 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:34,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:34,702 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:27:34,712 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:27:34,733 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:34,733 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:34,733 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:34,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:34,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:34,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:34,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:34,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 11:27:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:27:34,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:34,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:34,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 11:27:34,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:34,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803225020] [2019-10-22 11:27:34,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:34,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:34,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:35,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803225020] [2019-10-22 11:27:35,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:35,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:35,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065344914] [2019-10-22 11:27:35,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:35,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:35,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:35,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:35,130 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 11:27:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:35,562 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-10-22 11:27:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:35,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 11:27:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:35,578 INFO L225 Difference]: With dead ends: 313 [2019-10-22 11:27:35,578 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 11:27:35,584 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-10-22 11:27:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 11:27:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 11:27:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-10-22 11:27:35,631 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-10-22 11:27:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:35,632 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-10-22 11:27:35,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-10-22 11:27:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 11:27:35,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:35,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:35,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-10-22 11:27:35,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:35,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817278397] [2019-10-22 11:27:35,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:35,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817278397] [2019-10-22 11:27:35,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:35,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:35,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906116963] [2019-10-22 11:27:35,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:35,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:35,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:35,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:35,808 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-10-22 11:27:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,121 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-10-22 11:27:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:36,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 11:27:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,123 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:27:36,123 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 11:27:36,124 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-10-22 11:27:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 11:27:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 11:27:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-10-22 11:27:36,133 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-10-22 11:27:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,133 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-10-22 11:27:36,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-10-22 11:27:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:27:36,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:36,135 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-10-22 11:27:36,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119155958] [2019-10-22 11:27:36,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:36,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119155958] [2019-10-22 11:27:36,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:36,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634596049] [2019-10-22 11:27:36,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:36,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:36,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:36,223 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-10-22 11:27:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,519 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-10-22 11:27:36,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:36,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:27:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,521 INFO L225 Difference]: With dead ends: 279 [2019-10-22 11:27:36,521 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 11:27:36,522 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-10-22 11:27:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 11:27:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-10-22 11:27:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-10-22 11:27:36,530 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-10-22 11:27:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,530 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-10-22 11:27:36,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-10-22 11:27:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:27:36,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:36,532 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-10-22 11:27:36,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011347078] [2019-10-22 11:27:36,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:36,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011347078] [2019-10-22 11:27:36,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:36,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:36,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429667384] [2019-10-22 11:27:36,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:36,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:36,631 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-10-22 11:27:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:36,934 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-10-22 11:27:36,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:36,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:27:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:36,935 INFO L225 Difference]: With dead ends: 277 [2019-10-22 11:27:36,935 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 11:27:36,936 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-10-22 11:27:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 11:27:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-10-22 11:27:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-10-22 11:27:36,943 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-10-22 11:27:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-10-22 11:27:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-10-22 11:27:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:27:36,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:36,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:36,944 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-10-22 11:27:36,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:36,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516961688] [2019-10-22 11:27:36,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:36,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:37,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516961688] [2019-10-22 11:27:37,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:37,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626837259] [2019-10-22 11:27:37,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:37,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:37,014 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-10-22 11:27:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,267 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-10-22 11:27:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:37,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:27:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,268 INFO L225 Difference]: With dead ends: 276 [2019-10-22 11:27:37,269 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 11:27:37,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-10-22 11:27:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 11:27:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 11:27:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-10-22 11:27:37,284 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-10-22 11:27:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,285 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-10-22 11:27:37,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-10-22 11:27:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:27:37,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:37,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-10-22 11:27:37,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847745230] [2019-10-22 11:27:37,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:37,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847745230] [2019-10-22 11:27:37,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:37,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481935746] [2019-10-22 11:27:37,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:37,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:37,366 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-10-22 11:27:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,603 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-10-22 11:27:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:37,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:27:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,604 INFO L225 Difference]: With dead ends: 276 [2019-10-22 11:27:37,604 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 11:27:37,605 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-10-22 11:27:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 11:27:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 11:27:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-10-22 11:27:37,610 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-10-22 11:27:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,610 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-10-22 11:27:37,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-10-22 11:27:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 11:27:37,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:37,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-10-22 11:27:37,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016867745] [2019-10-22 11:27:37,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:37,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016867745] [2019-10-22 11:27:37,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:37,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431200479] [2019-10-22 11:27:37,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:37,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:37,663 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-10-22 11:27:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:37,883 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-10-22 11:27:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:37,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 11:27:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:37,884 INFO L225 Difference]: With dead ends: 276 [2019-10-22 11:27:37,884 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 11:27:37,885 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-10-22 11:27:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 11:27:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 11:27:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-10-22 11:27:37,891 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-10-22 11:27:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:37,891 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-10-22 11:27:37,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-10-22 11:27:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 11:27:37,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:37,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:37,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-10-22 11:27:37,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:37,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288962932] [2019-10-22 11:27:37,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:37,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:37,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288962932] [2019-10-22 11:27:37,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:37,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:37,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804825667] [2019-10-22 11:27:37,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:37,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:37,941 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-10-22 11:27:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:38,182 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-10-22 11:27:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:38,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 11:27:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:38,184 INFO L225 Difference]: With dead ends: 276 [2019-10-22 11:27:38,184 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 11:27:38,184 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-10-22 11:27:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 11:27:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 11:27:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-10-22 11:27:38,190 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-10-22 11:27:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:38,190 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-10-22 11:27:38,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-10-22 11:27:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 11:27:38,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:38,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:38,192 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-10-22 11:27:38,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:38,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289343109] [2019-10-22 11:27:38,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:38,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289343109] [2019-10-22 11:27:38,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:38,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:38,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325440347] [2019-10-22 11:27:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:38,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:38,261 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-10-22 11:27:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:38,443 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-10-22 11:27:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:38,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 11:27:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:38,445 INFO L225 Difference]: With dead ends: 266 [2019-10-22 11:27:38,445 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 11:27:38,445 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-10-22 11:27:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 11:27:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-10-22 11:27:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 11:27:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-10-22 11:27:38,453 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-10-22 11:27:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:38,453 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-10-22 11:27:38,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-10-22 11:27:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 11:27:38,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:38,454 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, 1, 1, 1] [2019-10-22 11:27:38,454 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:38,455 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-10-22 11:27:38,455 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:38,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919492102] [2019-10-22 11:27:38,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:38,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919492102] [2019-10-22 11:27:38,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:38,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:38,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720567552] [2019-10-22 11:27:38,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:38,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:38,533 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-10-22 11:27:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:38,802 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-10-22 11:27:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:38,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 11:27:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:38,804 INFO L225 Difference]: With dead ends: 306 [2019-10-22 11:27:38,804 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 11:27:38,805 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-10-22 11:27:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 11:27:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-10-22 11:27:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-10-22 11:27:38,810 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-10-22 11:27:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:38,810 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-10-22 11:27:38,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-10-22 11:27:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 11:27:38,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:38,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:38,812 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-10-22 11:27:38,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:38,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407245741] [2019-10-22 11:27:38,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:38,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:38,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407245741] [2019-10-22 11:27:38,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:38,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:38,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874807118] [2019-10-22 11:27:38,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:38,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:38,892 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-10-22 11:27:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:39,178 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-10-22 11:27:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:39,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-10-22 11:27:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:39,179 INFO L225 Difference]: With dead ends: 328 [2019-10-22 11:27:39,179 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 11:27:39,180 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-10-22 11:27:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 11:27:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-10-22 11:27:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-10-22 11:27:39,186 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-10-22 11:27:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:39,186 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-10-22 11:27:39,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-10-22 11:27:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:27:39,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:39,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:39,188 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-10-22 11:27:39,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:39,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34672693] [2019-10-22 11:27:39,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:39,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34672693] [2019-10-22 11:27:39,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:39,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:39,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596859978] [2019-10-22 11:27:39,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:39,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:39,292 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-10-22 11:27:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:39,563 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-10-22 11:27:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:39,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:27:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:39,565 INFO L225 Difference]: With dead ends: 327 [2019-10-22 11:27:39,565 INFO L226 Difference]: Without dead ends: 183 [2019-10-22 11:27:39,565 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-10-22 11:27:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-22 11:27:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-10-22 11:27:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-10-22 11:27:39,569 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-10-22 11:27:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:39,570 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-10-22 11:27:39,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-10-22 11:27:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:27:39,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:39,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:39,571 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-10-22 11:27:39,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:39,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739103609] [2019-10-22 11:27:39,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:39,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739103609] [2019-10-22 11:27:39,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:39,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:39,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714416850] [2019-10-22 11:27:39,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:39,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:39,625 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-10-22 11:27:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:39,886 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-10-22 11:27:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:39,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:27:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:39,887 INFO L225 Difference]: With dead ends: 325 [2019-10-22 11:27:39,887 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 11:27:39,888 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-10-22 11:27:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 11:27:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 11:27:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-10-22 11:27:39,893 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-10-22 11:27:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:39,893 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-10-22 11:27:39,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-10-22 11:27:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:27:39,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:39,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:39,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-10-22 11:27:39,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:39,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421241884] [2019-10-22 11:27:39,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:39,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:39,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421241884] [2019-10-22 11:27:39,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:39,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:39,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048912577] [2019-10-22 11:27:39,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:39,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:39,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:39,954 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-10-22 11:27:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:40,206 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-10-22 11:27:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:40,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:27:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:40,207 INFO L225 Difference]: With dead ends: 324 [2019-10-22 11:27:40,207 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 11:27:40,207 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-10-22 11:27:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 11:27:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 11:27:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-10-22 11:27:40,212 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-10-22 11:27:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:40,212 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-10-22 11:27:40,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-10-22 11:27:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:27:40,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:40,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:40,213 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-10-22 11:27:40,214 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:40,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277334950] [2019-10-22 11:27:40,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:40,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277334950] [2019-10-22 11:27:40,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:40,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:40,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114532183] [2019-10-22 11:27:40,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:40,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:40,280 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-10-22 11:27:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:40,525 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-10-22 11:27:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:40,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:27:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:40,527 INFO L225 Difference]: With dead ends: 324 [2019-10-22 11:27:40,527 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 11:27:40,527 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-10-22 11:27:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 11:27:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 11:27:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-10-22 11:27:40,531 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-10-22 11:27:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:40,531 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-10-22 11:27:40,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-10-22 11:27:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 11:27:40,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:40,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:40,533 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-10-22 11:27:40,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:40,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426877490] [2019-10-22 11:27:40,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:40,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426877490] [2019-10-22 11:27:40,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:40,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:40,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648248729] [2019-10-22 11:27:40,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:40,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:40,584 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-10-22 11:27:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:40,841 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-10-22 11:27:40,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:40,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 11:27:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:40,843 INFO L225 Difference]: With dead ends: 324 [2019-10-22 11:27:40,843 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 11:27:40,843 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-10-22 11:27:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 11:27:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 11:27:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-10-22 11:27:40,851 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-10-22 11:27:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:40,851 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-10-22 11:27:40,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-10-22 11:27:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 11:27:40,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:40,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:40,852 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-10-22 11:27:40,853 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:40,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547426216] [2019-10-22 11:27:40,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:40,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:40,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547426216] [2019-10-22 11:27:40,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:40,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:40,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071001192] [2019-10-22 11:27:40,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:40,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:40,895 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-10-22 11:27:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:41,144 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-10-22 11:27:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:41,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 11:27:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:41,145 INFO L225 Difference]: With dead ends: 324 [2019-10-22 11:27:41,145 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 11:27:41,146 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-10-22 11:27:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 11:27:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 11:27:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-10-22 11:27:41,149 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-10-22 11:27:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:41,150 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-10-22 11:27:41,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-10-22 11:27:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 11:27:41,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:41,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:41,150 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-10-22 11:27:41,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:41,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216037686] [2019-10-22 11:27:41,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:41,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216037686] [2019-10-22 11:27:41,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:41,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:41,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238344171] [2019-10-22 11:27:41,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:41,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:41,192 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-10-22 11:27:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:41,415 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-10-22 11:27:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:41,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 11:27:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:41,416 INFO L225 Difference]: With dead ends: 314 [2019-10-22 11:27:41,416 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 11:27:41,417 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-10-22 11:27:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 11:27:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-10-22 11:27:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:27:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-10-22 11:27:41,421 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-10-22 11:27:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:41,421 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-10-22 11:27:41,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-10-22 11:27:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:41,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:41,422 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, 1, 1] [2019-10-22 11:27:41,422 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-10-22 11:27:41,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:41,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556167138] [2019-10-22 11:27:41,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:41,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556167138] [2019-10-22 11:27:41,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:41,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:41,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482062970] [2019-10-22 11:27:41,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:41,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:41,482 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-10-22 11:27:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:41,835 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-10-22 11:27:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:41,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 11:27:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:41,838 INFO L225 Difference]: With dead ends: 402 [2019-10-22 11:27:41,838 INFO L226 Difference]: Without dead ends: 258 [2019-10-22 11:27:41,839 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-10-22 11:27:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-22 11:27:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-10-22 11:27:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 11:27:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-10-22 11:27:41,845 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-10-22 11:27:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:41,845 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-10-22 11:27:41,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-10-22 11:27:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:27:41,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:41,846 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, 1, 1] [2019-10-22 11:27:41,847 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-10-22 11:27:41,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:41,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072922936] [2019-10-22 11:27:41,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:41,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:41,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072922936] [2019-10-22 11:27:41,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:41,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:41,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887634591] [2019-10-22 11:27:41,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:41,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:41,932 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-10-22 11:27:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:42,233 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-10-22 11:27:42,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:42,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 11:27:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:42,234 INFO L225 Difference]: With dead ends: 442 [2019-10-22 11:27:42,234 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 11:27:42,235 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-10-22 11:27:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 11:27:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-10-22 11:27:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-10-22 11:27:42,240 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-10-22 11:27:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:42,240 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-10-22 11:27:42,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-10-22 11:27:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:27:42,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:42,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:42,242 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-10-22 11:27:42,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:42,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025809001] [2019-10-22 11:27:42,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:42,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025809001] [2019-10-22 11:27:42,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:42,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:42,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524152646] [2019-10-22 11:27:42,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:42,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:42,290 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-10-22 11:27:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:42,638 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-10-22 11:27:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:42,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 11:27:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:42,640 INFO L225 Difference]: With dead ends: 493 [2019-10-22 11:27:42,640 INFO L226 Difference]: Without dead ends: 282 [2019-10-22 11:27:42,640 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-10-22 11:27:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-22 11:27:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-10-22 11:27:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-10-22 11:27:42,647 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-10-22 11:27:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:42,647 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-10-22 11:27:42,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-10-22 11:27:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:27:42,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:42,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:42,648 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-10-22 11:27:42,649 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:42,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143218820] [2019-10-22 11:27:42,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:42,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143218820] [2019-10-22 11:27:42,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:42,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:42,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870990156] [2019-10-22 11:27:42,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:42,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:42,700 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-10-22 11:27:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:42,982 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-10-22 11:27:42,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:42,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 11:27:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:42,983 INFO L225 Difference]: With dead ends: 466 [2019-10-22 11:27:42,983 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 11:27:42,984 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-10-22 11:27:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 11:27:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-10-22 11:27:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-10-22 11:27:42,989 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-10-22 11:27:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:42,989 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-10-22 11:27:42,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-10-22 11:27:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:42,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:42,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:42,990 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-10-22 11:27:42,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:42,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975596902] [2019-10-22 11:27:42,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:42,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:43,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975596902] [2019-10-22 11:27:43,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:43,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:43,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293759579] [2019-10-22 11:27:43,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:43,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:43,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:43,036 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-10-22 11:27:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:43,375 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-10-22 11:27:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:43,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:27:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:43,377 INFO L225 Difference]: With dead ends: 492 [2019-10-22 11:27:43,377 INFO L226 Difference]: Without dead ends: 281 [2019-10-22 11:27:43,377 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-10-22 11:27:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-22 11:27:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-10-22 11:27:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-10-22 11:27:43,384 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-10-22 11:27:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:43,384 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-10-22 11:27:43,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-10-22 11:27:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:43,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:43,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:43,385 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-10-22 11:27:43,386 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:43,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162110469] [2019-10-22 11:27:43,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:43,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162110469] [2019-10-22 11:27:43,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:43,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:43,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818768728] [2019-10-22 11:27:43,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:43,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:43,438 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-10-22 11:27:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:43,785 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-10-22 11:27:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:43,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:27:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:43,787 INFO L225 Difference]: With dead ends: 490 [2019-10-22 11:27:43,787 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 11:27:43,788 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-10-22 11:27:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 11:27:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-10-22 11:27:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-10-22 11:27:43,795 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-10-22 11:27:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:43,795 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-10-22 11:27:43,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-10-22 11:27:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:43,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:43,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:43,797 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-10-22 11:27:43,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:43,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072869753] [2019-10-22 11:27:43,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:43,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:43,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072869753] [2019-10-22 11:27:43,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:43,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:43,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593666679] [2019-10-22 11:27:43,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:43,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:43,856 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-10-22 11:27:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:44,181 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-10-22 11:27:44,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:44,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:27:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:44,182 INFO L225 Difference]: With dead ends: 489 [2019-10-22 11:27:44,182 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 11:27:44,183 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-10-22 11:27:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 11:27:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-10-22 11:27:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 11:27:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-10-22 11:27:44,187 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-10-22 11:27:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:44,187 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-10-22 11:27:44,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-10-22 11:27:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:44,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:44,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:44,188 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-10-22 11:27:44,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:44,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606945434] [2019-10-22 11:27:44,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:44,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 11:27:44,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606945434] [2019-10-22 11:27:44,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:44,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:44,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994848980] [2019-10-22 11:27:44,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:44,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:44,255 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-10-22 11:27:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:44,673 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-10-22 11:27:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:44,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-22 11:27:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:44,674 INFO L225 Difference]: With dead ends: 462 [2019-10-22 11:27:44,674 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 11:27:44,674 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-10-22 11:27:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 11:27:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-10-22 11:27:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-10-22 11:27:44,679 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-10-22 11:27:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:44,679 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-10-22 11:27:44,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-10-22 11:27:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:44,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:44,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:44,680 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-10-22 11:27:44,681 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:44,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541111497] [2019-10-22 11:27:44,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:44,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:44,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:44,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541111497] [2019-10-22 11:27:44,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:44,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:44,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768652818] [2019-10-22 11:27:44,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:44,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:44,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:44,744 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-10-22 11:27:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:45,030 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-10-22 11:27:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:45,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:27:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:45,032 INFO L225 Difference]: With dead ends: 503 [2019-10-22 11:27:45,032 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 11:27:45,032 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-10-22 11:27:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 11:27:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 11:27:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-10-22 11:27:45,039 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-10-22 11:27:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,039 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-10-22 11:27:45,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-10-22 11:27:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:27:45,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:45,040 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-10-22 11:27:45,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916062663] [2019-10-22 11:27:45,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:45,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916062663] [2019-10-22 11:27:45,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:45,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961083469] [2019-10-22 11:27:45,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:45,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:45,093 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-10-22 11:27:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:45,345 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-10-22 11:27:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:45,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:27:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:45,347 INFO L225 Difference]: With dead ends: 502 [2019-10-22 11:27:45,347 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 11:27:45,347 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-10-22 11:27:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 11:27:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 11:27:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-10-22 11:27:45,352 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-10-22 11:27:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,352 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-10-22 11:27:45,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-10-22 11:27:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:27:45,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:45,353 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-10-22 11:27:45,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808721188] [2019-10-22 11:27:45,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:45,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808721188] [2019-10-22 11:27:45,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:45,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679541083] [2019-10-22 11:27:45,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:45,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:45,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:45,403 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-10-22 11:27:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:45,707 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-10-22 11:27:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:45,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 11:27:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:45,708 INFO L225 Difference]: With dead ends: 529 [2019-10-22 11:27:45,708 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 11:27:45,709 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-10-22 11:27:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 11:27:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 11:27:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-10-22 11:27:45,718 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-10-22 11:27:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:45,718 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-10-22 11:27:45,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-10-22 11:27:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:27:45,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:45,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:45,719 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-10-22 11:27:45,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:45,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44793440] [2019-10-22 11:27:45,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:45,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:45,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44793440] [2019-10-22 11:27:45,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:45,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:45,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787946825] [2019-10-22 11:27:45,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:45,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:45,763 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-10-22 11:27:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:46,021 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-10-22 11:27:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:46,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 11:27:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:46,022 INFO L225 Difference]: With dead ends: 502 [2019-10-22 11:27:46,023 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 11:27:46,023 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-10-22 11:27:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 11:27:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 11:27:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-10-22 11:27:46,029 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-10-22 11:27:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:46,029 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-10-22 11:27:46,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-10-22 11:27:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:27:46,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:46,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:46,030 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-10-22 11:27:46,030 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:46,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78617824] [2019-10-22 11:27:46,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:46,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78617824] [2019-10-22 11:27:46,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:46,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:46,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560768705] [2019-10-22 11:27:46,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:46,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:46,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:46,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:46,081 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-10-22 11:27:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:46,395 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-10-22 11:27:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:46,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 11:27:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:46,396 INFO L225 Difference]: With dead ends: 529 [2019-10-22 11:27:46,396 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 11:27:46,397 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-10-22 11:27:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 11:27:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 11:27:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-10-22 11:27:46,405 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-10-22 11:27:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:46,405 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-10-22 11:27:46,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-10-22 11:27:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:27:46,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:46,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:46,407 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-10-22 11:27:46,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:46,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330364341] [2019-10-22 11:27:46,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:46,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330364341] [2019-10-22 11:27:46,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:46,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:46,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472865159] [2019-10-22 11:27:46,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:46,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:46,461 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-10-22 11:27:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:46,709 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-10-22 11:27:46,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:46,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 11:27:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:46,711 INFO L225 Difference]: With dead ends: 502 [2019-10-22 11:27:46,711 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 11:27:46,711 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-10-22 11:27:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 11:27:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 11:27:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-10-22 11:27:46,718 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-10-22 11:27:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:46,718 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-10-22 11:27:46,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-10-22 11:27:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 11:27:46,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:46,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:46,720 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-10-22 11:27:46,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:46,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338118002] [2019-10-22 11:27:46,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:46,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:46,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338118002] [2019-10-22 11:27:46,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:46,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:46,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856305151] [2019-10-22 11:27:46,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:46,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:46,774 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-10-22 11:27:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,055 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-10-22 11:27:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:47,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 11:27:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,056 INFO L225 Difference]: With dead ends: 529 [2019-10-22 11:27:47,056 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 11:27:47,057 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-10-22 11:27:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 11:27:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 11:27:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-10-22 11:27:47,063 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-10-22 11:27:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,063 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-10-22 11:27:47,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-10-22 11:27:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 11:27:47,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:47,064 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-10-22 11:27:47,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321521783] [2019-10-22 11:27:47,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:47,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321521783] [2019-10-22 11:27:47,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:47,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:47,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123794086] [2019-10-22 11:27:47,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:47,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:47,127 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-10-22 11:27:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,390 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-10-22 11:27:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:47,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 11:27:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,392 INFO L225 Difference]: With dead ends: 502 [2019-10-22 11:27:47,392 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 11:27:47,392 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-10-22 11:27:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 11:27:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 11:27:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-10-22 11:27:47,399 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-10-22 11:27:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,400 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-10-22 11:27:47,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-10-22 11:27:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:27:47,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:47,401 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-10-22 11:27:47,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165476675] [2019-10-22 11:27:47,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:47,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165476675] [2019-10-22 11:27:47,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:47,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:47,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833404972] [2019-10-22 11:27:47,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:47,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:47,480 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-10-22 11:27:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,718 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-10-22 11:27:47,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:47,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 11:27:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,719 INFO L225 Difference]: With dead ends: 519 [2019-10-22 11:27:47,719 INFO L226 Difference]: Without dead ends: 288 [2019-10-22 11:27:47,720 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-10-22 11:27:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-22 11:27:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-10-22 11:27:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-10-22 11:27:47,726 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-10-22 11:27:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,726 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-10-22 11:27:47,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-10-22 11:27:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:27:47,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:47,728 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-10-22 11:27:47,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830401107] [2019-10-22 11:27:47,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:47,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830401107] [2019-10-22 11:27:47,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:47,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:47,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66429477] [2019-10-22 11:27:47,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:47,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:47,782 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-10-22 11:27:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:47,990 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-10-22 11:27:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:47,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 11:27:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:47,991 INFO L225 Difference]: With dead ends: 492 [2019-10-22 11:27:47,991 INFO L226 Difference]: Without dead ends: 261 [2019-10-22 11:27:47,992 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-10-22 11:27:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-22 11:27:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-10-22 11:27:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-10-22 11:27:47,997 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-10-22 11:27:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:47,997 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-10-22 11:27:47,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-10-22 11:27:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:27:47,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:47,998 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, 1] [2019-10-22 11:27:47,998 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-10-22 11:27:47,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:47,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923721736] [2019-10-22 11:27:47,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:47,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:27:48,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923721736] [2019-10-22 11:27:48,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:48,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:48,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941529643] [2019-10-22 11:27:48,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:48,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:48,051 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-10-22 11:27:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:48,389 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-10-22 11:27:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:48,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 11:27:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:48,390 INFO L225 Difference]: With dead ends: 519 [2019-10-22 11:27:48,390 INFO L226 Difference]: Without dead ends: 288 [2019-10-22 11:27:48,391 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-10-22 11:27:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-22 11:27:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-10-22 11:27:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 11:27:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-10-22 11:27:48,400 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-10-22 11:27:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:48,400 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-10-22 11:27:48,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-10-22 11:27:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:27:48,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:48,401 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, 1] [2019-10-22 11:27:48,401 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-10-22 11:27:48,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:48,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155695859] [2019-10-22 11:27:48,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:27:48,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155695859] [2019-10-22 11:27:48,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:48,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:48,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943397139] [2019-10-22 11:27:48,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:48,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:48,455 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-10-22 11:27:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:48,479 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-10-22 11:27:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:48,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 11:27:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:48,481 INFO L225 Difference]: With dead ends: 710 [2019-10-22 11:27:48,481 INFO L226 Difference]: Without dead ends: 479 [2019-10-22 11:27:48,482 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-10-22 11:27:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-22 11:27:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-22 11:27:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-22 11:27:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-10-22 11:27:48,491 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-10-22 11:27:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:48,492 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-10-22 11:27:48,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-10-22 11:27:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:27:48,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:48,493 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, 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] [2019-10-22 11:27:48,493 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-10-22 11:27:48,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:48,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999757982] [2019-10-22 11:27:48,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:48,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:48,736 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:27:48,737 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:48,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:48 BoogieIcfgContainer [2019-10-22 11:27:48,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:48,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:48,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:48,862 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:48,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:34" (3/4) ... [2019-10-22 11:27:48,865 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:27:48,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:48,867 INFO L168 Benchmark]: Toolchain (without parser) took 16074.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 419.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 272.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,868 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:48,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,871 INFO L168 Benchmark]: Boogie Preprocessor took 95.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,871 INFO L168 Benchmark]: RCFGBuilder took 1064.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.1 MB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,871 INFO L168 Benchmark]: TraceAbstraction took 14178.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.5 MB). Free memory was 999.1 MB in the beginning and 1.1 GB in the end (delta: -92.3 MB). Peak memory consumption was 189.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:48,871 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:48,873 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.61 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1064.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.1 MB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14178.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 281.5 MB). Free memory was 999.1 MB in the beginning and 1.1 GB in the end (delta: -92.3 MB). Peak memory consumption was 189.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. 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)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [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}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 9993 SDs, 0 SdLazy, 6809 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 84 SyntacticMatches, 33 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, 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, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 741519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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-10-22 11:27:50,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:50,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:50,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:50,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:50,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:50,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:50,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:51,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:51,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:51,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:51,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:51,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:51,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:51,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:51,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:51,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:51,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:51,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:51,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:51,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:51,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:51,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:51,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:51,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:51,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:51,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:51,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:51,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:51,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:51,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:51,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:51,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:51,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:51,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:51,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:51,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:51,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:51,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:51,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:51,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:51,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:27:51,037 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:51,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:51,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:51,038 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:51,038 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:51,039 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:51,039 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:51,039 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:51,039 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:51,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:51,040 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:51,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:51,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:51,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:27:51,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:51,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:51,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:51,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:51,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:51,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:51,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:51,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:51,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:51,043 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:27:51,043 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:27:51,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:51,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:51,044 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/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan 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 -> Taipan 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 -> 1c80528d715feba546d9b9f6f7af7c865965b863 [2019-10-22 11:27:51,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:51,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:51,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:51,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:51,086 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:51,086 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:51,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/6cd2b4a1e/d7ba363f08a242c2af5db49e72b18ca0/FLAG6e9e21389 [2019-10-22 11:27:51,639 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:51,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:51,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/6cd2b4a1e/d7ba363f08a242c2af5db49e72b18ca0/FLAG6e9e21389 [2019-10-22 11:27:52,154 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/data/6cd2b4a1e/d7ba363f08a242c2af5db49e72b18ca0 [2019-10-22 11:27:52,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:52,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:52,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:52,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:52,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:52,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:52,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d881ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52, skipping insertion in model container [2019-10-22 11:27:52,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:52,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:52,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:52,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:52,747 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:52,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:52,991 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:52,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52 WrapperNode [2019-10-22 11:27:52,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:52,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:52,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:52,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:53,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:53,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:53,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:53,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:53,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... [2019-10-22 11:27:53,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:53,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:53,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:53,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:53,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/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-10-22 11:27:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:27:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:27:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:27:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:27:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:27:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:27:53,415 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:27:55,759 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 11:27:55,760 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 11:27:55,761 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:55,761 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:27:55,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:55 BoogieIcfgContainer [2019-10-22 11:27:55,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:55,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:55,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:55,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:55,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:52" (1/3) ... [2019-10-22 11:27:55,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e66c9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:55, skipping insertion in model container [2019-10-22 11:27:55,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:52" (2/3) ... [2019-10-22 11:27:55,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e66c9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:55, skipping insertion in model container [2019-10-22 11:27:55,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:55" (3/3) ... [2019-10-22 11:27:55,773 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-10-22 11:27:55,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:55,789 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:27:55,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:27:55,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:55,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:55,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:55,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:55,823 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:55,823 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:55,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:55,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 11:27:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:27:55,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:55,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:55,854 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 11:27:55,866 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:55,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [788393116] [2019-10-22 11:27:55,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/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-10-22 11:27:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:56,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:27:56,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:56,096 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:56,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788393116] [2019-10-22 11:27:56,118 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:56,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:27:56,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467442106] [2019-10-22 11:27:56,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:56,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:27:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:56,137 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 11:27:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:56,245 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-10-22 11:27:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:56,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 11:27:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:56,260 INFO L225 Difference]: With dead ends: 540 [2019-10-22 11:27:56,264 INFO L226 Difference]: Without dead ends: 366 [2019-10-22 11:27:56,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-10-22 11:27:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-22 11:27:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-10-22 11:27:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-22 11:27:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-10-22 11:27:56,327 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-10-22 11:27:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:56,327 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-10-22 11:27:56,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-10-22 11:27:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 11:27:56,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:56,331 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 11:27:56,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:56,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-10-22 11:27:56,534 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:56,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1817103390] [2019-10-22 11:27:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/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-10-22 11:27:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:56,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:27:56,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:56,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:56,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1817103390] [2019-10-22 11:27:56,843 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:56,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:27:56,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180300192] [2019-10-22 11:27:56,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:56,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:27:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:56,847 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-10-22 11:27:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:57,024 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-10-22 11:27:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:57,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 11:27:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:57,027 INFO L225 Difference]: With dead ends: 839 [2019-10-22 11:27:57,027 INFO L226 Difference]: Without dead ends: 600 [2019-10-22 11:27:57,029 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-10-22 11:27:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-22 11:27:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-22 11:27:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-22 11:27:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-10-22 11:27:57,072 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-10-22 11:27:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:57,077 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-10-22 11:27:57,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-10-22 11:27:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:27:57,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:57,083 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, 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] [2019-10-22 11:27:57,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:57,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-10-22 11:27:57,293 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:57,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [67227312] [2019-10-22 11:27:57,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/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-10-22 11:27:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:27:59,161 INFO L168 tionRefinementEngine]: Strategy WALRUS found a feasible trace [2019-10-22 11:27:59,161 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:27:59,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:59,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:59 BoogieIcfgContainer [2019-10-22 11:27:59,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:59,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:59,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:59,508 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:59,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:55" (3/4) ... [2019-10-22 11:27:59,510 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:27:59,652 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c15aa84c-88c9-4449-948c-ffc9a4c715ac/bin/utaipan/witness.graphml [2019-10-22 11:27:59,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:59,653 INFO L168 Benchmark]: Toolchain (without parser) took 7495.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,654 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:59,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.76 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,654 INFO L168 Benchmark]: Boogie Preprocessor took 73.56 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,655 INFO L168 Benchmark]: RCFGBuilder took 2580.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 92.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,655 INFO L168 Benchmark]: TraceAbstraction took 3740.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 999.7 MB in the beginning and 1.2 GB in the end (delta: -161.3 MB). Peak memory consumption was 217.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,655 INFO L168 Benchmark]: Witness Printer took 144.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:59,657 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.76 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.56 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2580.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 92.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3740.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 999.7 MB in the beginning and 1.2 GB in the end (delta: -161.3 MB). Peak memory consumption was 217.3 MB. Max. memory is 11.5 GB. * Witness Printer took 144.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: 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={-1476592689: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)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [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={-1476592689: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={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689: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={-1476592689: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={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689: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={-1476592689:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 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...