./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/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 b9ebacab53db4f4e6d9f51b7145688401913e247 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-6b5699a [2019-11-26 02:24:57,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:24:57,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:24:57,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:24:57,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:24:57,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:24:57,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:24:57,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:24:57,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:24:57,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:24:57,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:24:57,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:24:57,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:24:57,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:24:57,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:24:57,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:24:57,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:24:57,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:24:57,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:24:57,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:24:57,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:24:57,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:24:57,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:24:57,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:24:57,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:24:57,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:24:57,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:24:57,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:24:57,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:24:57,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:24:57,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:24:57,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:24:57,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:24:57,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:24:57,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:24:57,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:24:57,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:24:57,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:24:57,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:24:57,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:24:57,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:24:57,864 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:24:57,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:24:57,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:24:57,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:24:57,898 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:24:57,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:24:57,899 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:24:57,899 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:24:57,899 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:24:57,899 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:24:57,900 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:24:57,900 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:24:57,900 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:24:57,900 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:24:57,900 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:24:57,900 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:24:57,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:24:57,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:24:57,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:24:57,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:24:57,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:24:57,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:24:57,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:24:57,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:24:57,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:24:57,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:24:57,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:24:57,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:24:57,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:24:57,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:24:57,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:24:57,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:24:57,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:24:57,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:24:57,904 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:24:57,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:24:57,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:24:57,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:24:57,905 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/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/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 -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-26 02:24:58,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:24:58,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:24:58,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:24:58,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:24:58,059 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:24:58,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-26 02:24:58,117 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/data/750ec8ded/0fc124f0ab8f4202bda1c2379f14908e/FLAG98cf1059f [2019-11-26 02:24:58,584 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:24:58,585 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-26 02:24:58,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/data/750ec8ded/0fc124f0ab8f4202bda1c2379f14908e/FLAG98cf1059f [2019-11-26 02:24:58,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/data/750ec8ded/0fc124f0ab8f4202bda1c2379f14908e [2019-11-26 02:24:58,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:24:58,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:24:58,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:24:58,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:24:58,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:24:58,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:24:58" (1/1) ... [2019-11-26 02:24:58,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cf2ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:58, skipping insertion in model container [2019-11-26 02:24:58,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:24:58" (1/1) ... [2019-11-26 02:24:58,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:24:59,000 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:24:59,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:24:59,372 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:24:59,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:24:59,459 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:24:59,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59 WrapperNode [2019-11-26 02:24:59,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:24:59,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:24:59,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:24:59,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:24:59,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:24:59,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:24:59,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:24:59,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:24:59,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... [2019-11-26 02:24:59,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:24:59,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:24:59,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:24:59,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:24:59,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/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-11-26 02:24:59,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:24:59,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:24:59,769 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:25:00,477 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-26 02:25:00,477 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-26 02:25:00,818 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:25:00,818 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:25:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:25:00 BoogieIcfgContainer [2019-11-26 02:25:00,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:25:00,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:25:00,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:25:00,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:25:00,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:24:58" (1/3) ... [2019-11-26 02:25:00,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110e27d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:25:00, skipping insertion in model container [2019-11-26 02:25:00,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:24:59" (2/3) ... [2019-11-26 02:25:00,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110e27d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:25:00, skipping insertion in model container [2019-11-26 02:25:00,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:25:00" (3/3) ... [2019-11-26 02:25:00,828 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-26 02:25:00,837 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:25:00,845 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:25:00,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:25:00,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:25:00,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:25:00,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:25:00,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:25:00,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:25:00,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:25:00,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:25:00,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:25:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-26 02:25:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:25:00,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:00,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:00,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash -814957616, now seen corresponding path program 1 times [2019-11-26 02:25:00,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:00,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537518074] [2019-11-26 02:25:00,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537518074] [2019-11-26 02:25:01,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:01,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:01,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484595351] [2019-11-26 02:25:01,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:01,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,116 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2019-11-26 02:25:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:01,312 INFO L93 Difference]: Finished difference Result 257 states and 449 transitions. [2019-11-26 02:25:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:01,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-26 02:25:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:01,326 INFO L225 Difference]: With dead ends: 257 [2019-11-26 02:25:01,326 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 02:25:01,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 02:25:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-26 02:25:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-26 02:25:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2019-11-26 02:25:01,401 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 21 [2019-11-26 02:25:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:01,402 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2019-11-26 02:25:01,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2019-11-26 02:25:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:25:01,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:01,404 INFO L410 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] [2019-11-26 02:25:01,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1704208736, now seen corresponding path program 1 times [2019-11-26 02:25:01,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:01,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218658649] [2019-11-26 02:25:01,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:01,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218658649] [2019-11-26 02:25:01,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:01,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:01,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398101709] [2019-11-26 02:25:01,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,497 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand 3 states. [2019-11-26 02:25:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:01,669 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2019-11-26 02:25:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:01,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:25:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:01,672 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:25:01,673 INFO L226 Difference]: Without dead ends: 143 [2019-11-26 02:25:01,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-26 02:25:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2019-11-26 02:25:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:25:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2019-11-26 02:25:01,692 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 23 [2019-11-26 02:25:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:01,693 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2019-11-26 02:25:01,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2019-11-26 02:25:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:25:01,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:01,696 INFO L410 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] [2019-11-26 02:25:01,696 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1765644408, now seen corresponding path program 1 times [2019-11-26 02:25:01,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:01,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436372482] [2019-11-26 02:25:01,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:01,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436372482] [2019-11-26 02:25:01,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:01,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:01,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511184503] [2019-11-26 02:25:01,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:01,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:01,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,763 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand 3 states. [2019-11-26 02:25:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:01,926 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-26 02:25:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:01,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:25:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:01,928 INFO L225 Difference]: With dead ends: 286 [2019-11-26 02:25:01,928 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 02:25:01,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 02:25:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-26 02:25:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:25:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2019-11-26 02:25:01,945 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 23 [2019-11-26 02:25:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:01,946 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2019-11-26 02:25:01,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2019-11-26 02:25:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:25:01,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:01,955 INFO L410 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] [2019-11-26 02:25:01,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1394401220, now seen corresponding path program 1 times [2019-11-26 02:25:01,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:01,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237804552] [2019-11-26 02:25:01,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237804552] [2019-11-26 02:25:02,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:02,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123648376] [2019-11-26 02:25:02,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:02,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,010 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 3 states. [2019-11-26 02:25:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:02,161 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2019-11-26 02:25:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:02,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:25:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:02,163 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:25:02,163 INFO L226 Difference]: Without dead ends: 157 [2019-11-26 02:25:02,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-26 02:25:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-26 02:25:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 02:25:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-11-26 02:25:02,176 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 23 [2019-11-26 02:25:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:02,177 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-11-26 02:25:02,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-11-26 02:25:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:25:02,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:02,178 INFO L410 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] [2019-11-26 02:25:02,178 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:02,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1515910148, now seen corresponding path program 1 times [2019-11-26 02:25:02,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:02,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468599152] [2019-11-26 02:25:02,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468599152] [2019-11-26 02:25:02,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:02,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077257864] [2019-11-26 02:25:02,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:02,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,220 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 3 states. [2019-11-26 02:25:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:02,378 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2019-11-26 02:25:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:02,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:25:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:02,380 INFO L225 Difference]: With dead ends: 320 [2019-11-26 02:25:02,380 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:25:02,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:25:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-26 02:25:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 02:25:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2019-11-26 02:25:02,389 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 24 [2019-11-26 02:25:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:02,390 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2019-11-26 02:25:02,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2019-11-26 02:25:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:25:02,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:02,391 INFO L410 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] [2019-11-26 02:25:02,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -369185236, now seen corresponding path program 1 times [2019-11-26 02:25:02,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:02,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780147989] [2019-11-26 02:25:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780147989] [2019-11-26 02:25:02,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:02,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599861398] [2019-11-26 02:25:02,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:02,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:02,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,425 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand 3 states. [2019-11-26 02:25:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:02,556 INFO L93 Difference]: Finished difference Result 314 states and 476 transitions. [2019-11-26 02:25:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:02,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:25:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:02,558 INFO L225 Difference]: With dead ends: 314 [2019-11-26 02:25:02,558 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 02:25:02,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 02:25:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-26 02:25:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 02:25:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2019-11-26 02:25:02,570 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2019-11-26 02:25:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:02,571 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2019-11-26 02:25:02,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2019-11-26 02:25:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:25:02,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:02,572 INFO L410 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] [2019-11-26 02:25:02,572 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1667011611, now seen corresponding path program 1 times [2019-11-26 02:25:02,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:02,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138230436] [2019-11-26 02:25:02,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138230436] [2019-11-26 02:25:02,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:02,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310282161] [2019-11-26 02:25:02,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:02,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,615 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand 3 states. [2019-11-26 02:25:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:02,738 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2019-11-26 02:25:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:02,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-26 02:25:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:02,741 INFO L225 Difference]: With dead ends: 320 [2019-11-26 02:25:02,741 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:25:02,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:25:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-26 02:25:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 02:25:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2019-11-26 02:25:02,748 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 25 [2019-11-26 02:25:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:02,749 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2019-11-26 02:25:02,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2019-11-26 02:25:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:25:02,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:02,753 INFO L410 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] [2019-11-26 02:25:02,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1480730391, now seen corresponding path program 1 times [2019-11-26 02:25:02,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:02,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439562821] [2019-11-26 02:25:02,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439562821] [2019-11-26 02:25:02,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:02,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012297104] [2019-11-26 02:25:02,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:02,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,788 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand 3 states. [2019-11-26 02:25:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:02,921 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-11-26 02:25:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:02,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-26 02:25:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:02,923 INFO L225 Difference]: With dead ends: 320 [2019-11-26 02:25:02,923 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:25:02,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:25:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-26 02:25:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 02:25:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2019-11-26 02:25:02,933 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 26 [2019-11-26 02:25:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:02,933 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2019-11-26 02:25:02,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2019-11-26 02:25:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:25:02,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:02,934 INFO L410 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] [2019-11-26 02:25:02,934 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1189380498, now seen corresponding path program 1 times [2019-11-26 02:25:02,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:02,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907064507] [2019-11-26 02:25:02,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:02,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907064507] [2019-11-26 02:25:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:25:02,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037468164] [2019-11-26 02:25:02,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:25:02,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:25:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:25:02,983 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand 4 states. [2019-11-26 02:25:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:03,209 INFO L93 Difference]: Finished difference Result 446 states and 659 transitions. [2019-11-26 02:25:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:25:03,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-26 02:25:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:03,212 INFO L225 Difference]: With dead ends: 446 [2019-11-26 02:25:03,212 INFO L226 Difference]: Without dead ends: 291 [2019-11-26 02:25:03,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:25:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-26 02:25:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2019-11-26 02:25:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-26 02:25:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 397 transitions. [2019-11-26 02:25:03,230 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 397 transitions. Word has length 26 [2019-11-26 02:25:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:03,231 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 397 transitions. [2019-11-26 02:25:03,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:25:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2019-11-26 02:25:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:25:03,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:03,232 INFO L410 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] [2019-11-26 02:25:03,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 357320297, now seen corresponding path program 1 times [2019-11-26 02:25:03,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:03,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870878258] [2019-11-26 02:25:03,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:03,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870878258] [2019-11-26 02:25:03,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:03,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:03,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703335533] [2019-11-26 02:25:03,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:03,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,283 INFO L87 Difference]: Start difference. First operand 267 states and 397 transitions. Second operand 3 states. [2019-11-26 02:25:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:03,451 INFO L93 Difference]: Finished difference Result 612 states and 929 transitions. [2019-11-26 02:25:03,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:03,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-26 02:25:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:03,456 INFO L225 Difference]: With dead ends: 612 [2019-11-26 02:25:03,456 INFO L226 Difference]: Without dead ends: 347 [2019-11-26 02:25:03,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-26 02:25:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2019-11-26 02:25:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-26 02:25:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2019-11-26 02:25:03,474 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 39 [2019-11-26 02:25:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:03,475 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2019-11-26 02:25:03,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2019-11-26 02:25:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:25:03,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:03,476 INFO L410 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] [2019-11-26 02:25:03,477 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 37401672, now seen corresponding path program 1 times [2019-11-26 02:25:03,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:03,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170144273] [2019-11-26 02:25:03,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:03,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170144273] [2019-11-26 02:25:03,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:03,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455389617] [2019-11-26 02:25:03,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:03,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,523 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand 3 states. [2019-11-26 02:25:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:03,690 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2019-11-26 02:25:03,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:03,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-26 02:25:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:03,693 INFO L225 Difference]: With dead ends: 670 [2019-11-26 02:25:03,693 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 02:25:03,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 02:25:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 332. [2019-11-26 02:25:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 02:25:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-11-26 02:25:03,710 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 40 [2019-11-26 02:25:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:03,713 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-11-26 02:25:03,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-11-26 02:25:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:25:03,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:03,715 INFO L410 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] [2019-11-26 02:25:03,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1642271592, now seen corresponding path program 1 times [2019-11-26 02:25:03,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:03,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053332158] [2019-11-26 02:25:03,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:25:03,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053332158] [2019-11-26 02:25:03,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:03,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:03,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740494952] [2019-11-26 02:25:03,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:03,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,762 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2019-11-26 02:25:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:03,909 INFO L93 Difference]: Finished difference Result 710 states and 1087 transitions. [2019-11-26 02:25:03,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:03,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-26 02:25:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:03,912 INFO L225 Difference]: With dead ends: 710 [2019-11-26 02:25:03,912 INFO L226 Difference]: Without dead ends: 380 [2019-11-26 02:25:03,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-26 02:25:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2019-11-26 02:25:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-26 02:25:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-11-26 02:25:03,930 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 49 [2019-11-26 02:25:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:03,930 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-11-26 02:25:03,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-11-26 02:25:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:25:03,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:03,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:03,932 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1949419570, now seen corresponding path program 1 times [2019-11-26 02:25:03,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:03,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580399298] [2019-11-26 02:25:03,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:25:03,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580399298] [2019-11-26 02:25:03,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:03,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:03,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184226341] [2019-11-26 02:25:03,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:03,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:03,959 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 3 states. [2019-11-26 02:25:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:04,124 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2019-11-26 02:25:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:04,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-26 02:25:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:04,128 INFO L225 Difference]: With dead ends: 791 [2019-11-26 02:25:04,128 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:25:04,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:25:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2019-11-26 02:25:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-26 02:25:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2019-11-26 02:25:04,147 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 49 [2019-11-26 02:25:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:04,147 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2019-11-26 02:25:04,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2019-11-26 02:25:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-26 02:25:04,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:04,149 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:25:04,149 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1558490573, now seen corresponding path program 1 times [2019-11-26 02:25:04,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:04,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638055573] [2019-11-26 02:25:04,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:25:04,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638055573] [2019-11-26 02:25:04,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:04,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:04,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372424811] [2019-11-26 02:25:04,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:04,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,180 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand 3 states. [2019-11-26 02:25:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:04,340 INFO L93 Difference]: Finished difference Result 860 states and 1309 transitions. [2019-11-26 02:25:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:04,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-26 02:25:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:04,343 INFO L225 Difference]: With dead ends: 860 [2019-11-26 02:25:04,344 INFO L226 Difference]: Without dead ends: 435 [2019-11-26 02:25:04,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-26 02:25:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2019-11-26 02:25:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-26 02:25:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 645 transitions. [2019-11-26 02:25:04,362 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 645 transitions. Word has length 61 [2019-11-26 02:25:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:04,363 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 645 transitions. [2019-11-26 02:25:04,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 645 transitions. [2019-11-26 02:25:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:25:04,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:04,364 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:04,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash 852247642, now seen corresponding path program 1 times [2019-11-26 02:25:04,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:04,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110709683] [2019-11-26 02:25:04,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:04,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110709683] [2019-11-26 02:25:04,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:04,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:04,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749293743] [2019-11-26 02:25:04,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:04,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,395 INFO L87 Difference]: Start difference. First operand 427 states and 645 transitions. Second operand 3 states. [2019-11-26 02:25:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:04,564 INFO L93 Difference]: Finished difference Result 897 states and 1354 transitions. [2019-11-26 02:25:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:04,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-26 02:25:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:04,568 INFO L225 Difference]: With dead ends: 897 [2019-11-26 02:25:04,568 INFO L226 Difference]: Without dead ends: 472 [2019-11-26 02:25:04,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-26 02:25:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2019-11-26 02:25:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-26 02:25:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2019-11-26 02:25:04,589 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 72 [2019-11-26 02:25:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:04,590 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2019-11-26 02:25:04,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2019-11-26 02:25:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-26 02:25:04,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:04,591 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:04,591 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash -55546437, now seen corresponding path program 1 times [2019-11-26 02:25:04,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:04,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25162502] [2019-11-26 02:25:04,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:25:04,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25162502] [2019-11-26 02:25:04,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:04,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:04,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663669852] [2019-11-26 02:25:04,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:04,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,629 INFO L87 Difference]: Start difference. First operand 468 states and 704 transitions. Second operand 3 states. [2019-11-26 02:25:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:04,793 INFO L93 Difference]: Finished difference Result 936 states and 1408 transitions. [2019-11-26 02:25:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:04,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-26 02:25:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:04,796 INFO L225 Difference]: With dead ends: 936 [2019-11-26 02:25:04,797 INFO L226 Difference]: Without dead ends: 470 [2019-11-26 02:25:04,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-26 02:25:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-11-26 02:25:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-26 02:25:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2019-11-26 02:25:04,820 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 73 [2019-11-26 02:25:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:04,821 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2019-11-26 02:25:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2019-11-26 02:25:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:25:04,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:04,822 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:04,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1900779534, now seen corresponding path program 1 times [2019-11-26 02:25:04,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:04,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019481278] [2019-11-26 02:25:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:25:04,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019481278] [2019-11-26 02:25:04,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:04,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:04,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211002381] [2019-11-26 02:25:04,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:04,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:04,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:04,853 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand 3 states. [2019-11-26 02:25:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:05,011 INFO L93 Difference]: Finished difference Result 934 states and 1400 transitions. [2019-11-26 02:25:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:05,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:25:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:05,015 INFO L225 Difference]: With dead ends: 934 [2019-11-26 02:25:05,015 INFO L226 Difference]: Without dead ends: 468 [2019-11-26 02:25:05,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-26 02:25:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2019-11-26 02:25:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-26 02:25:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2019-11-26 02:25:05,045 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 78 [2019-11-26 02:25:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:05,045 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2019-11-26 02:25:05,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2019-11-26 02:25:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-26 02:25:05,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:05,047 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:05,047 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1755033985, now seen corresponding path program 1 times [2019-11-26 02:25:05,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:05,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933588054] [2019-11-26 02:25:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-26 02:25:05,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933588054] [2019-11-26 02:25:05,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:05,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:05,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327034285] [2019-11-26 02:25:05,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:05,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:05,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,086 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand 3 states. [2019-11-26 02:25:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:05,254 INFO L93 Difference]: Finished difference Result 980 states and 1462 transitions. [2019-11-26 02:25:05,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:05,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-26 02:25:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:05,257 INFO L225 Difference]: With dead ends: 980 [2019-11-26 02:25:05,257 INFO L226 Difference]: Without dead ends: 516 [2019-11-26 02:25:05,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-26 02:25:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2019-11-26 02:25:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-26 02:25:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 732 transitions. [2019-11-26 02:25:05,281 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 732 transitions. Word has length 85 [2019-11-26 02:25:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:05,282 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 732 transitions. [2019-11-26 02:25:05,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 732 transitions. [2019-11-26 02:25:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:25:05,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:05,283 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:05,283 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash -885196477, now seen corresponding path program 1 times [2019-11-26 02:25:05,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:05,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044197628] [2019-11-26 02:25:05,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-26 02:25:05,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044197628] [2019-11-26 02:25:05,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:05,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:05,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257016867] [2019-11-26 02:25:05,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:05,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,334 INFO L87 Difference]: Start difference. First operand 496 states and 732 transitions. Second operand 3 states. [2019-11-26 02:25:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:05,474 INFO L93 Difference]: Finished difference Result 1000 states and 1478 transitions. [2019-11-26 02:25:05,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:05,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-26 02:25:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:05,477 INFO L225 Difference]: With dead ends: 1000 [2019-11-26 02:25:05,477 INFO L226 Difference]: Without dead ends: 506 [2019-11-26 02:25:05,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-11-26 02:25:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2019-11-26 02:25:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-26 02:25:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2019-11-26 02:25:05,503 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 86 [2019-11-26 02:25:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:05,503 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2019-11-26 02:25:05,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2019-11-26 02:25:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-26 02:25:05,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:05,505 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:05,506 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1731983446, now seen corresponding path program 1 times [2019-11-26 02:25:05,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:05,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744492387] [2019-11-26 02:25:05,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:25:05,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744492387] [2019-11-26 02:25:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:05,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983918564] [2019-11-26 02:25:05,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:05,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,543 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand 3 states. [2019-11-26 02:25:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:05,712 INFO L93 Difference]: Finished difference Result 1044 states and 1527 transitions. [2019-11-26 02:25:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:05,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-26 02:25:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:05,716 INFO L225 Difference]: With dead ends: 1044 [2019-11-26 02:25:05,716 INFO L226 Difference]: Without dead ends: 550 [2019-11-26 02:25:05,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-26 02:25:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2019-11-26 02:25:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-11-26 02:25:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 797 transitions. [2019-11-26 02:25:05,743 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 797 transitions. Word has length 90 [2019-11-26 02:25:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:05,743 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 797 transitions. [2019-11-26 02:25:05,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 797 transitions. [2019-11-26 02:25:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-26 02:25:05,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:05,745 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:05,746 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 733600939, now seen corresponding path program 1 times [2019-11-26 02:25:05,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:05,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060563377] [2019-11-26 02:25:05,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:25:05,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060563377] [2019-11-26 02:25:05,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:05,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:05,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784082490] [2019-11-26 02:25:05,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:05,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,783 INFO L87 Difference]: Start difference. First operand 546 states and 797 transitions. Second operand 3 states. [2019-11-26 02:25:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:05,959 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2019-11-26 02:25:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:05,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-26 02:25:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:05,962 INFO L225 Difference]: With dead ends: 1093 [2019-11-26 02:25:05,962 INFO L226 Difference]: Without dead ends: 545 [2019-11-26 02:25:05,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-11-26 02:25:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2019-11-26 02:25:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-26 02:25:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 791 transitions. [2019-11-26 02:25:05,990 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 791 transitions. Word has length 91 [2019-11-26 02:25:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:05,990 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 791 transitions. [2019-11-26 02:25:05,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 791 transitions. [2019-11-26 02:25:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-26 02:25:05,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:05,992 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:05,992 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1885246774, now seen corresponding path program 1 times [2019-11-26 02:25:05,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:05,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7181909] [2019-11-26 02:25:05,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:25:06,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7181909] [2019-11-26 02:25:06,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:06,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:06,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485246036] [2019-11-26 02:25:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:06,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,024 INFO L87 Difference]: Start difference. First operand 543 states and 791 transitions. Second operand 3 states. [2019-11-26 02:25:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:06,203 INFO L93 Difference]: Finished difference Result 1127 states and 1639 transitions. [2019-11-26 02:25:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:06,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-26 02:25:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:06,207 INFO L225 Difference]: With dead ends: 1127 [2019-11-26 02:25:06,207 INFO L226 Difference]: Without dead ends: 586 [2019-11-26 02:25:06,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-26 02:25:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-11-26 02:25:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-26 02:25:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 841 transitions. [2019-11-26 02:25:06,232 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 841 transitions. Word has length 103 [2019-11-26 02:25:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:06,233 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 841 transitions. [2019-11-26 02:25:06,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 841 transitions. [2019-11-26 02:25:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:25:06,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:06,235 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:06,235 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 937544789, now seen corresponding path program 1 times [2019-11-26 02:25:06,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:06,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284171372] [2019-11-26 02:25:06,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:25:06,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284171372] [2019-11-26 02:25:06,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:06,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:06,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007591220] [2019-11-26 02:25:06,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:06,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,264 INFO L87 Difference]: Start difference. First operand 582 states and 841 transitions. Second operand 3 states. [2019-11-26 02:25:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:06,441 INFO L93 Difference]: Finished difference Result 1164 states and 1682 transitions. [2019-11-26 02:25:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:06,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-26 02:25:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:06,444 INFO L225 Difference]: With dead ends: 1164 [2019-11-26 02:25:06,444 INFO L226 Difference]: Without dead ends: 584 [2019-11-26 02:25:06,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-26 02:25:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2019-11-26 02:25:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-26 02:25:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2019-11-26 02:25:06,470 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 104 [2019-11-26 02:25:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:06,470 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2019-11-26 02:25:06,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2019-11-26 02:25:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-26 02:25:06,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:06,472 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:25:06,472 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1290691939, now seen corresponding path program 1 times [2019-11-26 02:25:06,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:06,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133718574] [2019-11-26 02:25:06,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-26 02:25:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133718574] [2019-11-26 02:25:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470564917] [2019-11-26 02:25:06,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:06,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,519 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand 3 states. [2019-11-26 02:25:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:06,662 INFO L93 Difference]: Finished difference Result 1198 states and 1720 transitions. [2019-11-26 02:25:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:06,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-26 02:25:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:06,666 INFO L225 Difference]: With dead ends: 1198 [2019-11-26 02:25:06,666 INFO L226 Difference]: Without dead ends: 618 [2019-11-26 02:25:06,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-26 02:25:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2019-11-26 02:25:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-26 02:25:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 867 transitions. [2019-11-26 02:25:06,698 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 867 transitions. Word has length 106 [2019-11-26 02:25:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:06,698 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 867 transitions. [2019-11-26 02:25:06,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 867 transitions. [2019-11-26 02:25:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:25:06,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:06,700 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:25:06,700 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1015508545, now seen corresponding path program 1 times [2019-11-26 02:25:06,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:06,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053272348] [2019-11-26 02:25:06,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-26 02:25:06,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053272348] [2019-11-26 02:25:06,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:06,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:06,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557961142] [2019-11-26 02:25:06,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:06,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,736 INFO L87 Difference]: Start difference. First operand 610 states and 867 transitions. Second operand 3 states. [2019-11-26 02:25:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:06,880 INFO L93 Difference]: Finished difference Result 1222 states and 1737 transitions. [2019-11-26 02:25:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:06,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-26 02:25:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:06,884 INFO L225 Difference]: With dead ends: 1222 [2019-11-26 02:25:06,884 INFO L226 Difference]: Without dead ends: 614 [2019-11-26 02:25:06,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-26 02:25:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2019-11-26 02:25:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-26 02:25:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 858 transitions. [2019-11-26 02:25:06,913 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 858 transitions. Word has length 107 [2019-11-26 02:25:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:06,913 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 858 transitions. [2019-11-26 02:25:06,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 858 transitions. [2019-11-26 02:25:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-26 02:25:06,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:06,915 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:06,915 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:06,916 INFO L82 PathProgramCache]: Analyzing trace with hash -583880554, now seen corresponding path program 1 times [2019-11-26 02:25:06,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:06,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912377957] [2019-11-26 02:25:06,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-26 02:25:06,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912377957] [2019-11-26 02:25:06,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:06,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:06,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394901989] [2019-11-26 02:25:06,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:06,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:06,949 INFO L87 Difference]: Start difference. First operand 610 states and 858 transitions. Second operand 3 states. [2019-11-26 02:25:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:07,082 INFO L93 Difference]: Finished difference Result 1248 states and 1754 transitions. [2019-11-26 02:25:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:07,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-26 02:25:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:07,086 INFO L225 Difference]: With dead ends: 1248 [2019-11-26 02:25:07,086 INFO L226 Difference]: Without dead ends: 640 [2019-11-26 02:25:07,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-26 02:25:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-11-26 02:25:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-26 02:25:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 884 transitions. [2019-11-26 02:25:07,118 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 884 transitions. Word has length 124 [2019-11-26 02:25:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:07,118 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 884 transitions. [2019-11-26 02:25:07,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 884 transitions. [2019-11-26 02:25:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-26 02:25:07,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:07,122 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:07,122 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:07,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2014192274, now seen corresponding path program 1 times [2019-11-26 02:25:07,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:07,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662176527] [2019-11-26 02:25:07,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-26 02:25:07,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662176527] [2019-11-26 02:25:07,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:07,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:07,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855122410] [2019-11-26 02:25:07,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:07,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:07,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,160 INFO L87 Difference]: Start difference. First operand 636 states and 884 transitions. Second operand 3 states. [2019-11-26 02:25:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:07,323 INFO L93 Difference]: Finished difference Result 1272 states and 1768 transitions. [2019-11-26 02:25:07,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:07,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-26 02:25:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:07,327 INFO L225 Difference]: With dead ends: 1272 [2019-11-26 02:25:07,327 INFO L226 Difference]: Without dead ends: 638 [2019-11-26 02:25:07,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-26 02:25:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-11-26 02:25:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-26 02:25:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 874 transitions. [2019-11-26 02:25:07,356 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 874 transitions. Word has length 125 [2019-11-26 02:25:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:07,357 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 874 transitions. [2019-11-26 02:25:07,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 874 transitions. [2019-11-26 02:25:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-26 02:25:07,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:07,359 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:07,359 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1234829430, now seen corresponding path program 1 times [2019-11-26 02:25:07,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:07,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985357214] [2019-11-26 02:25:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-26 02:25:07,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985357214] [2019-11-26 02:25:07,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:07,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:07,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192280207] [2019-11-26 02:25:07,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:07,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,423 INFO L87 Difference]: Start difference. First operand 636 states and 874 transitions. Second operand 3 states. [2019-11-26 02:25:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:07,609 INFO L93 Difference]: Finished difference Result 1321 states and 1809 transitions. [2019-11-26 02:25:07,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:07,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-26 02:25:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:07,614 INFO L225 Difference]: With dead ends: 1321 [2019-11-26 02:25:07,614 INFO L226 Difference]: Without dead ends: 687 [2019-11-26 02:25:07,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-26 02:25:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2019-11-26 02:25:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-11-26 02:25:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 928 transitions. [2019-11-26 02:25:07,675 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 928 transitions. Word has length 129 [2019-11-26 02:25:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:07,675 INFO L462 AbstractCegarLoop]: Abstraction has 681 states and 928 transitions. [2019-11-26 02:25:07,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 928 transitions. [2019-11-26 02:25:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-26 02:25:07,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:07,677 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:25:07,677 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -768067575, now seen corresponding path program 1 times [2019-11-26 02:25:07,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:07,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479344384] [2019-11-26 02:25:07,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-26 02:25:07,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479344384] [2019-11-26 02:25:07,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:07,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:07,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720771444] [2019-11-26 02:25:07,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:07,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:07,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,713 INFO L87 Difference]: Start difference. First operand 681 states and 928 transitions. Second operand 3 states. [2019-11-26 02:25:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:07,891 INFO L93 Difference]: Finished difference Result 1363 states and 1857 transitions. [2019-11-26 02:25:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:07,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-26 02:25:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:07,895 INFO L225 Difference]: With dead ends: 1363 [2019-11-26 02:25:07,896 INFO L226 Difference]: Without dead ends: 668 [2019-11-26 02:25:07,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-11-26 02:25:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 665. [2019-11-26 02:25:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-26 02:25:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 905 transitions. [2019-11-26 02:25:07,926 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 905 transitions. Word has length 130 [2019-11-26 02:25:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:07,926 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 905 transitions. [2019-11-26 02:25:07,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 905 transitions. [2019-11-26 02:25:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-26 02:25:07,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:07,928 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:25:07,928 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1248036782, now seen corresponding path program 1 times [2019-11-26 02:25:07,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:07,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471762054] [2019-11-26 02:25:07,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-26 02:25:07,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471762054] [2019-11-26 02:25:07,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:07,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:07,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730340184] [2019-11-26 02:25:07,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:07,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:07,962 INFO L87 Difference]: Start difference. First operand 665 states and 905 transitions. Second operand 3 states. [2019-11-26 02:25:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:08,119 INFO L93 Difference]: Finished difference Result 1332 states and 1813 transitions. [2019-11-26 02:25:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-26 02:25:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:08,123 INFO L225 Difference]: With dead ends: 1332 [2019-11-26 02:25:08,123 INFO L226 Difference]: Without dead ends: 669 [2019-11-26 02:25:08,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-11-26 02:25:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2019-11-26 02:25:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-26 02:25:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 898 transitions. [2019-11-26 02:25:08,153 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 898 transitions. Word has length 134 [2019-11-26 02:25:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:08,154 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 898 transitions. [2019-11-26 02:25:08,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 898 transitions. [2019-11-26 02:25:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-26 02:25:08,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:08,156 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:25:08,156 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2121917619, now seen corresponding path program 1 times [2019-11-26 02:25:08,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:08,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238235608] [2019-11-26 02:25:08,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-26 02:25:08,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238235608] [2019-11-26 02:25:08,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:08,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:25:08,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904784334] [2019-11-26 02:25:08,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:08,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:08,189 INFO L87 Difference]: Start difference. First operand 665 states and 898 transitions. Second operand 3 states. [2019-11-26 02:25:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:08,345 INFO L93 Difference]: Finished difference Result 1320 states and 1782 transitions. [2019-11-26 02:25:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:08,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-26 02:25:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:08,348 INFO L225 Difference]: With dead ends: 1320 [2019-11-26 02:25:08,349 INFO L226 Difference]: Without dead ends: 640 [2019-11-26 02:25:08,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-26 02:25:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-11-26 02:25:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-11-26 02:25:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 853 transitions. [2019-11-26 02:25:08,378 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 853 transitions. Word has length 135 [2019-11-26 02:25:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:08,378 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 853 transitions. [2019-11-26 02:25:08,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 853 transitions. [2019-11-26 02:25:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-26 02:25:08,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:08,380 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:08,380 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1878713645, now seen corresponding path program 1 times [2019-11-26 02:25:08,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:08,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959833345] [2019-11-26 02:25:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:25:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-26 02:25:08,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959833345] [2019-11-26 02:25:08,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:25:08,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:25:08,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136502901] [2019-11-26 02:25:08,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:25:08,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:25:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:25:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:08,429 INFO L87 Difference]: Start difference. First operand 636 states and 853 transitions. Second operand 3 states. [2019-11-26 02:25:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:25:08,493 INFO L93 Difference]: Finished difference Result 1885 states and 2523 transitions. [2019-11-26 02:25:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:25:08,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-26 02:25:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:25:08,500 INFO L225 Difference]: With dead ends: 1885 [2019-11-26 02:25:08,500 INFO L226 Difference]: Without dead ends: 1251 [2019-11-26 02:25:08,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:25:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-11-26 02:25:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2019-11-26 02:25:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-11-26 02:25:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1668 transitions. [2019-11-26 02:25:08,570 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1668 transitions. Word has length 139 [2019-11-26 02:25:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:25:08,570 INFO L462 AbstractCegarLoop]: Abstraction has 1249 states and 1668 transitions. [2019-11-26 02:25:08,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:25:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1668 transitions. [2019-11-26 02:25:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-26 02:25:08,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:25:08,572 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:25:08,572 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:25:08,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:25:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash -831110033, now seen corresponding path program 1 times [2019-11-26 02:25:08,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:25:08,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536553311] [2019-11-26 02:25:08,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:25:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:25:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:25:08,741 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:25:08,742 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:25:08,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:25:08 BoogieIcfgContainer [2019-11-26 02:25:08,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:25:08,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:25:08,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:25:08,840 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:25:08,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:25:00" (3/4) ... [2019-11-26 02:25:08,842 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:25:08,974 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f28592fd-848f-4d2b-ba82-78ab571cada1/bin/utaipan/witness.graphml [2019-11-26 02:25:08,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:25:08,977 INFO L168 Benchmark]: Toolchain (without parser) took 10048.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -393.0 MB). Peak memory consumption was 358.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,977 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:25:08,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:25:08,979 INFO L168 Benchmark]: Boogie Preprocessor took 55.64 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,979 INFO L168 Benchmark]: RCFGBuilder took 1236.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,979 INFO L168 Benchmark]: TraceAbstraction took 8018.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 999.8 MB in the beginning and 844.5 MB in the end (delta: 155.3 MB). Peak memory consumption was 278.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,980 INFO L168 Benchmark]: Witness Printer took 135.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 103.3 MB). Free memory was 844.5 MB in the beginning and 1.3 GB in the end (delta: -493.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:25:08,982 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.64 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1236.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8018.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 999.8 MB in the beginning and 844.5 MB in the end (delta: 155.3 MB). Peak memory consumption was 278.0 MB. Max. memory is 11.5 GB. * Witness Printer took 135.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 103.3 MB). Free memory was 844.5 MB in the beginning and 1.3 GB in the end (delta: -493.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.9s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3969 SDtfs, 4395 SDslu, 816 SDs, 0 SdLazy, 2772 SolverSat, 1263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 198 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2332 ConstructedInterpolants, 0 QuantifiedInterpolants, 394525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 1895/1895 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...