./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/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 1e9943d2199c95030d170f0541cc4df722deb62f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/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 1e9943d2199c95030d170f0541cc4df722deb62f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:46:03,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:46:03,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:46:03,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:46:03,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:46:03,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:46:03,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:46:03,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:46:03,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:46:03,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:46:03,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:46:03,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:46:03,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:46:03,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:46:03,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:46:03,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:46:03,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:46:03,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:46:03,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:46:03,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:46:03,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:46:03,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:46:03,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:46:03,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:46:03,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:46:03,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:46:03,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:46:03,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:46:03,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:46:03,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:46:03,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:46:03,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:46:03,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:46:03,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:46:03,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:46:03,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:46:03,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:46:03,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:46:03,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:46:03,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:46:03,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:46:03,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:46:03,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:46:03,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:46:03,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:46:03,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:46:03,919 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:46:03,920 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:46:03,920 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:46:03,920 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:46:03,920 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:46:03,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:46:03,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:46:03,921 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:46:03,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:46:03,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:46:03,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:46:03,923 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:46:03,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:46:03,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:46:03,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:46:03,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:46:03,923 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_9bbb1c21-5952-4589-aa3b-26552d0a2256/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-12-07 14:46:04,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:46:04,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:46:04,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:46:04,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:46:04,031 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:46:04,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:04,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/1fce0213d/3dfcac8dd1814626a41c4b93511bbf9f/FLAG4dd024847 [2019-12-07 14:46:04,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:46:04,424 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:04,434 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/1fce0213d/3dfcac8dd1814626a41c4b93511bbf9f/FLAG4dd024847 [2019-12-07 14:46:04,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/1fce0213d/3dfcac8dd1814626a41c4b93511bbf9f [2019-12-07 14:46:04,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:46:04,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:46:04,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:46:04,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:46:04,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:46:04,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04, skipping insertion in model container [2019-12-07 14:46:04,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:46:04,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:46:04,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:46:04,667 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:46:04,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:46:04,710 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:46:04,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04 WrapperNode [2019-12-07 14:46:04,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:46:04,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:46:04,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:46:04,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:46:04,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:46:04,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:46:04,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:46:04,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:46:04,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... [2019-12-07 14:46:04,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:46:04,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:46:04,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:46:04,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:46:04,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/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-12-07 14:46:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:46:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:46:04,882 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:46:05,141 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 14:46:05,141 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 14:46:05,325 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:46:05,325 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:46:05,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:05 BoogieIcfgContainer [2019-12-07 14:46:05,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:46:05,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:46:05,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:46:05,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:46:05,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:46:04" (1/3) ... [2019-12-07 14:46:05,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ba6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:46:05, skipping insertion in model container [2019-12-07 14:46:05,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:04" (2/3) ... [2019-12-07 14:46:05,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ba6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:46:05, skipping insertion in model container [2019-12-07 14:46:05,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:05" (3/3) ... [2019-12-07 14:46:05,332 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:05,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:46:05,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:46:05,352 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:46:05,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:46:05,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:46:05,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:46:05,369 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:46:05,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:46:05,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:46:05,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:46:05,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:46:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-12-07 14:46:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:46:05,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:05,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:05,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1052459066, now seen corresponding path program 1 times [2019-12-07 14:46:05,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:05,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476547060] [2019-12-07 14:46:05,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:05,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476547060] [2019-12-07 14:46:05,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:05,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:46:05,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359445889] [2019-12-07 14:46:05,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:05,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:05,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:05,513 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-12-07 14:46:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:05,617 INFO L93 Difference]: Finished difference Result 169 states and 293 transitions. [2019-12-07 14:46:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:05,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:46:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:05,626 INFO L225 Difference]: With dead ends: 169 [2019-12-07 14:46:05,626 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:46:05,628 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-12-07 14:46:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:46:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 14:46:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:46:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2019-12-07 14:46:05,656 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 19 [2019-12-07 14:46:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:05,656 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2019-12-07 14:46:05,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2019-12-07 14:46:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:46:05,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:05,657 INFO L410 BasicCegarLoop]: trace histogram [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-12-07 14:46:05,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 344589790, now seen corresponding path program 1 times [2019-12-07 14:46:05,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:05,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190908881] [2019-12-07 14:46:05,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:05,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190908881] [2019-12-07 14:46:05,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:05,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:05,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220012975] [2019-12-07 14:46:05,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:05,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:05,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:05,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:05,699 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand 3 states. [2019-12-07 14:46:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:05,787 INFO L93 Difference]: Finished difference Result 178 states and 261 transitions. [2019-12-07 14:46:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:05,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 14:46:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:05,789 INFO L225 Difference]: With dead ends: 178 [2019-12-07 14:46:05,789 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 14:46:05,790 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-12-07 14:46:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 14:46:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-12-07 14:46:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:46:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2019-12-07 14:46:05,799 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 28 [2019-12-07 14:46:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:05,799 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2019-12-07 14:46:05,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2019-12-07 14:46:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:46:05,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:05,801 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:05,801 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2120880484, now seen corresponding path program 1 times [2019-12-07 14:46:05,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:05,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345993081] [2019-12-07 14:46:05,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:46:05,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345993081] [2019-12-07 14:46:05,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:05,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:05,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566695358] [2019-12-07 14:46:05,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:05,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:05,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:05,840 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand 3 states. [2019-12-07 14:46:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:05,925 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2019-12-07 14:46:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:05,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 14:46:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:05,927 INFO L225 Difference]: With dead ends: 206 [2019-12-07 14:46:05,927 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 14:46:05,928 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-12-07 14:46:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 14:46:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-12-07 14:46:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 14:46:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2019-12-07 14:46:05,935 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 39 [2019-12-07 14:46:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:05,936 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2019-12-07 14:46:05,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2019-12-07 14:46:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:46:05,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:05,937 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:05,938 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -59016443, now seen corresponding path program 1 times [2019-12-07 14:46:05,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:05,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332656276] [2019-12-07 14:46:05,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:46:06,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332656276] [2019-12-07 14:46:06,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528659713] [2019-12-07 14:46:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:06,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:46:06,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 14:46:06,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 14:46:06,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:46:06,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 9 [2019-12-07 14:46:06,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192226510] [2019-12-07 14:46:06,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:46:06,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:46:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:46:06,131 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand 6 states. [2019-12-07 14:46:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:06,364 INFO L93 Difference]: Finished difference Result 312 states and 467 transitions. [2019-12-07 14:46:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:46:06,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 14:46:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:06,366 INFO L225 Difference]: With dead ends: 312 [2019-12-07 14:46:06,366 INFO L226 Difference]: Without dead ends: 203 [2019-12-07 14:46:06,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:46:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-12-07 14:46:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2019-12-07 14:46:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 14:46:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 255 transitions. [2019-12-07 14:46:06,378 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 255 transitions. Word has length 52 [2019-12-07 14:46:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:06,378 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 255 transitions. [2019-12-07 14:46:06,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:46:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 255 transitions. [2019-12-07 14:46:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:46:06,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:06,380 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:06,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:06,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -209492546, now seen corresponding path program 1 times [2019-12-07 14:46:06,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:06,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986161841] [2019-12-07 14:46:06,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:46:06,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986161841] [2019-12-07 14:46:06,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:06,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:06,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531025943] [2019-12-07 14:46:06,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:06,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:06,653 INFO L87 Difference]: Start difference. First operand 186 states and 255 transitions. Second operand 3 states. [2019-12-07 14:46:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:06,720 INFO L93 Difference]: Finished difference Result 390 states and 543 transitions. [2019-12-07 14:46:06,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:06,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 14:46:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:06,722 INFO L225 Difference]: With dead ends: 390 [2019-12-07 14:46:06,722 INFO L226 Difference]: Without dead ends: 207 [2019-12-07 14:46:06,723 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-12-07 14:46:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-07 14:46:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-12-07 14:46:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 14:46:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2019-12-07 14:46:06,730 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 67 [2019-12-07 14:46:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:06,731 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2019-12-07 14:46:06,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2019-12-07 14:46:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:46:06,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:06,732 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2019-12-07 14:46:06,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:06,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:06,733 INFO L82 PathProgramCache]: Analyzing trace with hash 783641461, now seen corresponding path program 1 times [2019-12-07 14:46:06,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:06,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998668076] [2019-12-07 14:46:06,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:46:06,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998668076] [2019-12-07 14:46:06,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856630376] [2019-12-07 14:46:06,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:06,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:46:06,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 14:46:06,855 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 14:46:06,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868757367] [2019-12-07 14:46:06,915 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-12-07 14:46:06,916 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:46:06,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:46:06,925 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:46:06,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:46:08,952 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:46:09,197 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2019-12-07 14:46:09,430 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-12-07 14:46:09,670 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 112 [2019-12-07 14:46:09,912 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2019-12-07 14:46:10,334 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2019-12-07 14:46:10,688 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 124 [2019-12-07 14:46:10,989 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 126 [2019-12-07 14:46:11,261 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 114 [2019-12-07 14:46:11,537 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-12-07 14:46:11,932 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 109 [2019-12-07 14:46:12,316 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2019-12-07 14:46:12,861 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-12-07 14:46:13,282 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 115 [2019-12-07 14:46:13,752 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2019-12-07 14:46:14,196 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2019-12-07 14:46:14,592 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 113 [2019-12-07 14:46:14,913 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-12-07 14:46:15,218 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 110 [2019-12-07 14:46:15,552 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2019-12-07 14:46:15,995 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2019-12-07 14:46:16,412 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-12-07 14:46:16,743 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2019-12-07 14:46:17,068 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 109 [2019-12-07 14:46:17,441 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-12-07 14:46:17,937 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-07 14:46:18,345 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 128 [2019-12-07 14:46:18,724 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2019-12-07 14:46:19,094 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-12-07 14:46:19,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:46:19,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [5, 4, 3] total 36 [2019-12-07 14:46:19,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560576914] [2019-12-07 14:46:19,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 14:46:19,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 14:46:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:46:19,097 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand 30 states. [2019-12-07 14:46:19,418 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-12-07 14:46:19,713 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-12-07 14:46:20,576 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 118 [2019-12-07 14:46:21,007 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-12-07 14:46:21,694 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2019-12-07 14:46:22,072 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2019-12-07 14:46:22,472 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 126 [2019-12-07 14:46:23,005 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2019-12-07 14:46:23,604 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-12-07 14:46:23,936 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 129 [2019-12-07 14:46:24,240 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 120 [2019-12-07 14:46:24,581 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 132 [2019-12-07 14:46:24,976 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-12-07 14:46:25,584 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2019-12-07 14:46:26,139 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-12-07 14:46:26,714 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2019-12-07 14:46:26,983 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-12-07 14:46:27,280 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-12-07 14:46:27,612 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2019-12-07 14:46:28,005 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 133 [2019-12-07 14:46:28,380 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 136 [2019-12-07 14:46:28,666 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 113 [2019-12-07 14:46:29,055 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2019-12-07 14:46:29,398 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 123 [2019-12-07 14:46:29,746 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-12-07 14:46:30,119 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-12-07 14:46:30,508 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 121 [2019-12-07 14:46:31,068 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2019-12-07 14:46:31,447 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-12-07 14:46:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:32,874 INFO L93 Difference]: Finished difference Result 637 states and 845 transitions. [2019-12-07 14:46:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 14:46:32,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-12-07 14:46:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:32,877 INFO L225 Difference]: With dead ends: 637 [2019-12-07 14:46:32,877 INFO L226 Difference]: Without dead ends: 435 [2019-12-07 14:46:32,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 201 SyntacticMatches, 22 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=899, Invalid=3391, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 14:46:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-07 14:46:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 319. [2019-12-07 14:46:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-07 14:46:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 407 transitions. [2019-12-07 14:46:32,892 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 407 transitions. Word has length 85 [2019-12-07 14:46:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:32,892 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 407 transitions. [2019-12-07 14:46:32,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 14:46:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 407 transitions. [2019-12-07 14:46:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:46:32,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:32,894 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2019-12-07 14:46:33,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:33,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1877733027, now seen corresponding path program 1 times [2019-12-07 14:46:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:33,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650811505] [2019-12-07 14:46:33,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:46:33,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650811505] [2019-12-07 14:46:33,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60216881] [2019-12-07 14:46:33,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:33,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:46:33,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:46:33,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 14:46:33,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715500104] [2019-12-07 14:46:33,297 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2019-12-07 14:46:33,298 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:46:33,298 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:46:33,298 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:46:33,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:46:35,043 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:46:35,315 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 108 [2019-12-07 14:46:35,543 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-12-07 14:46:35,783 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2019-12-07 14:46:36,025 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-12-07 14:46:36,276 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2019-12-07 14:46:36,571 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2019-12-07 14:46:36,881 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 124 [2019-12-07 14:46:37,200 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 126 [2019-12-07 14:46:37,477 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-12-07 14:46:37,783 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-12-07 14:46:38,354 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-12-07 14:46:38,808 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2019-12-07 14:46:39,526 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-12-07 14:46:39,907 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-12-07 14:46:40,315 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 119 [2019-12-07 14:46:40,739 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 117 [2019-12-07 14:46:41,354 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 116 [2019-12-07 14:46:41,706 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2019-12-07 14:46:42,027 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-12-07 14:46:42,356 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-12-07 14:46:42,752 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 115 [2019-12-07 14:46:43,406 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2019-12-07 14:46:43,842 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 125 [2019-12-07 14:46:44,186 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 108 [2019-12-07 14:46:44,573 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 111 [2019-12-07 14:46:44,950 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2019-12-07 14:46:45,670 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2019-12-07 14:46:46,112 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 131 [2019-12-07 14:46:46,500 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 108 [2019-12-07 14:46:46,853 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 107 [2019-12-07 14:46:46,855 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:46:46,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:46:46,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 8 [2019-12-07 14:46:46,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450122017] [2019-12-07 14:46:46,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:46:46,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:46:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1268, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:46:46,857 INFO L87 Difference]: Start difference. First operand 319 states and 407 transitions. Second operand 9 states. [2019-12-07 14:46:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:46,909 INFO L93 Difference]: Finished difference Result 754 states and 990 transitions. [2019-12-07 14:46:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:46:46,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-07 14:46:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:46,913 INFO L225 Difference]: With dead ends: 754 [2019-12-07 14:46:46,913 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 14:46:46,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 199 SyntacticMatches, 26 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=214, Invalid=1268, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:46:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 14:46:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 679. [2019-12-07 14:46:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-07 14:46:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 904 transitions. [2019-12-07 14:46:46,931 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 904 transitions. Word has length 86 [2019-12-07 14:46:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:46,931 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 904 transitions. [2019-12-07 14:46:46,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:46:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 904 transitions. [2019-12-07 14:46:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 14:46:46,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:46,933 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2019-12-07 14:46:47,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:47,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1542965034, now seen corresponding path program 1 times [2019-12-07 14:46:47,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:47,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662452096] [2019-12-07 14:46:47,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 14:46:47,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662452096] [2019-12-07 14:46:47,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:47,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:47,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721701864] [2019-12-07 14:46:47,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:47,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:47,173 INFO L87 Difference]: Start difference. First operand 679 states and 904 transitions. Second operand 3 states. [2019-12-07 14:46:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:47,292 INFO L93 Difference]: Finished difference Result 1374 states and 1912 transitions. [2019-12-07 14:46:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:47,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 14:46:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:47,296 INFO L225 Difference]: With dead ends: 1374 [2019-12-07 14:46:47,296 INFO L226 Difference]: Without dead ends: 807 [2019-12-07 14:46:47,297 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-12-07 14:46:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-12-07 14:46:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 742. [2019-12-07 14:46:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-12-07 14:46:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 988 transitions. [2019-12-07 14:46:47,317 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 988 transitions. Word has length 143 [2019-12-07 14:46:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:47,317 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 988 transitions. [2019-12-07 14:46:47,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 988 transitions. [2019-12-07 14:46:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 14:46:47,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:47,319 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-12-07 14:46:47,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash -880154664, now seen corresponding path program 2 times [2019-12-07 14:46:47,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:47,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887939154] [2019-12-07 14:46:47,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-12-07 14:46:47,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887939154] [2019-12-07 14:46:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:47,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410485040] [2019-12-07 14:46:47,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:47,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:47,364 INFO L87 Difference]: Start difference. First operand 742 states and 988 transitions. Second operand 3 states. [2019-12-07 14:46:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:47,481 INFO L93 Difference]: Finished difference Result 1562 states and 2190 transitions. [2019-12-07 14:46:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:47,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-12-07 14:46:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:47,485 INFO L225 Difference]: With dead ends: 1562 [2019-12-07 14:46:47,485 INFO L226 Difference]: Without dead ends: 884 [2019-12-07 14:46:47,486 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-12-07 14:46:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-12-07 14:46:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 837. [2019-12-07 14:46:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-12-07 14:46:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1112 transitions. [2019-12-07 14:46:47,504 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1112 transitions. Word has length 152 [2019-12-07 14:46:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:47,504 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1112 transitions. [2019-12-07 14:46:47,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1112 transitions. [2019-12-07 14:46:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 14:46:47,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:47,506 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-12-07 14:46:47,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 52184040, now seen corresponding path program 1 times [2019-12-07 14:46:47,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:47,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920046239] [2019-12-07 14:46:47,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 14:46:47,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920046239] [2019-12-07 14:46:47,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:47,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:46:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077092695] [2019-12-07 14:46:47,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:47,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:46:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:47,571 INFO L87 Difference]: Start difference. First operand 837 states and 1112 transitions. Second operand 3 states. [2019-12-07 14:46:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:47,610 INFO L93 Difference]: Finished difference Result 1320 states and 1766 transitions. [2019-12-07 14:46:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:47,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 14:46:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:47,615 INFO L225 Difference]: With dead ends: 1320 [2019-12-07 14:46:47,615 INFO L226 Difference]: Without dead ends: 837 [2019-12-07 14:46:47,616 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-12-07 14:46:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-12-07 14:46:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-12-07 14:46:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-12-07 14:46:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1110 transitions. [2019-12-07 14:46:47,652 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1110 transitions. Word has length 163 [2019-12-07 14:46:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:47,653 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1110 transitions. [2019-12-07 14:46:47,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1110 transitions. [2019-12-07 14:46:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:46:47,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:47,655 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-12-07 14:46:47,655 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1216890698, now seen corresponding path program 1 times [2019-12-07 14:46:47,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:46:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402571831] [2019-12-07 14:46:47,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:46:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:46:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:46:47,764 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:46:47,764 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:46:47,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:46:47 BoogieIcfgContainer [2019-12-07 14:46:47,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:46:47,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:46:47,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:46:47,826 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:46:47,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:05" (3/4) ... [2019-12-07 14:46:47,829 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:46:47,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:46:47,830 INFO L168 Benchmark]: Toolchain (without parser) took 43381.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 457.7 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -286.7 MB). Peak memory consumption was 171.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:46:47,830 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:46:47,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:46:47,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:46:47,831 INFO L168 Benchmark]: Boogie Preprocessor took 26.12 ms. Allocated memory is still 1.1 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-12-07 14:46:47,831 INFO L168 Benchmark]: RCFGBuilder took 553.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:46:47,831 INFO L168 Benchmark]: TraceAbstraction took 42497.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 358.1 MB). Free memory was 994.6 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:46:47,832 INFO L168 Benchmark]: Witness Printer took 3.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:46:47,833 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.12 ms. Allocated memory is still 1.1 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 553.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42497.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 358.1 MB). Free memory was 994.6 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 608]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 356. Possible FailurePath: [L617] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND TRUE blastFlag == 3 [L324] blastFlag = 4 [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND FALSE !(blastFlag == 5) [L351] COND FALSE !(ret <= 0) [L356] s__state = ag_X ^ ag_Y [L357] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND FALSE !(blastFlag == 3) [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND TRUE blastFlag == 5 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 1 error locations. Result: UNSAFE, OverallTime: 42.3s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1418 SDtfs, 1842 SDslu, 1644 SDs, 0 SdLazy, 2693 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 512 SyntacticMatches, 48 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 324 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1221 NumberOfCodeBlocks, 1221 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 380673 SizeOfPredicates, 5 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1788/2327 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2037, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 61, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 333, TOOLS_POST_TIME[ms]: 133, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 255, TOOLS_QUANTIFIERELIM_TIME[ms]: 88, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 4, FLUID_QUERY_TIME[ms]: 10, FLUID_QUERIES: 411, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 33, DOMAIN_JOIN_TIME[ms]: 1531, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 104, DOMAIN_ISSUBSETEQ_APPLICATIONS: 15, DOMAIN_ISSUBSETEQ_TIME[ms]: 17, DOMAIN_ISBOTTOM_APPLICATIONS: 61, DOMAIN_ISBOTTOM_TIME[ms]: 122, LOOP_SUMMARIZER_APPLICATIONS: 13, LOOP_SUMMARIZER_CACHE_MISSES: 13, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1144, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1143, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 15, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 71, DAG_COMPRESSION_PROCESSED_NODES: 4873, DAG_COMPRESSION_RETAINED_NODES: 189, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:46:49,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:46:49,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:46:49,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:46:49,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:46:49,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:46:49,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:46:49,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:46:49,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:46:49,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:46:49,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:46:49,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:46:49,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:46:49,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:46:49,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:46:49,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:46:49,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:46:49,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:46:49,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:46:49,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:46:49,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:46:49,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:46:49,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:46:49,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:46:49,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:46:49,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:46:49,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:46:49,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:46:49,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:46:49,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:46:49,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:46:49,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:46:49,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:46:49,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:46:49,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:46:49,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:46:49,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:46:49,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:46:49,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:46:49,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:46:49,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:46:49,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 14:46:49,319 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:46:49,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:46:49,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:46:49,320 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:46:49,320 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:46:49,320 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:46:49,321 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:46:49,321 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:46:49,321 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:46:49,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:46:49,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:46:49,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:46:49,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:46:49,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:46:49,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:46:49,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:46:49,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:46:49,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:46:49,325 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-12-07 14:46:49,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:46:49,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:46:49,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:46:49,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:46:49,494 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:46:49,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:49,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/27ca60c61/aca1215f790f416482dd9ce1f47db167/FLAGb303c0258 [2019-12-07 14:46:49,980 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:46:49,981 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:49,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/27ca60c61/aca1215f790f416482dd9ce1f47db167/FLAGb303c0258 [2019-12-07 14:46:49,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/data/27ca60c61/aca1215f790f416482dd9ce1f47db167 [2019-12-07 14:46:50,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:46:50,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:46:50,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:46:50,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:46:50,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:46:50,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:46:49" (1/1) ... [2019-12-07 14:46:50,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41944eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50, skipping insertion in model container [2019-12-07 14:46:50,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:46:49" (1/1) ... [2019-12-07 14:46:50,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:46:50,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:46:50,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:46:50,175 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:46:50,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:46:50,252 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:46:50,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50 WrapperNode [2019-12-07 14:46:50,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:46:50,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:46:50,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:46:50,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:46:50,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:46:50,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:46:50,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:46:50,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:46:50,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... [2019-12-07 14:46:50,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:46:50,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:46:50,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:46:50,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:46:50,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/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-12-07 14:46:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:46:50,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:46:50,429 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:46:50,721 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 14:46:50,721 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 14:46:50,722 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:46:50,722 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:46:50,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:50 BoogieIcfgContainer [2019-12-07 14:46:50,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:46:50,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:46:50,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:46:50,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:46:50,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:46:49" (1/3) ... [2019-12-07 14:46:50,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344410eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:46:50, skipping insertion in model container [2019-12-07 14:46:50,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:46:50" (2/3) ... [2019-12-07 14:46:50,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344410eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:46:50, skipping insertion in model container [2019-12-07 14:46:50,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:50" (3/3) ... [2019-12-07 14:46:50,727 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-12-07 14:46:50,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:46:50,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:46:50,746 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:46:50,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:46:50,762 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:46:50,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:46:50,762 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:46:50,762 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:46:50,762 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:46:50,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:46:50,762 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:46:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 14:46:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:46:50,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:50,779 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-12-07 14:46:50,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-12-07 14:46:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:50,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352876012] [2019-12-07 14:46:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:50,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:50,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:50,876 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:50,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352876012] [2019-12-07 14:46:50,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:50,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:46:50,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257737236] [2019-12-07 14:46:50,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:50,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:50,896 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-12-07 14:46:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:51,017 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-12-07 14:46:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:51,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 14:46:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:51,026 INFO L225 Difference]: With dead ends: 245 [2019-12-07 14:46:51,026 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 14:46:51,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-12-07 14:46:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 14:46:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 14:46:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 14:46:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-12-07 14:46:51,061 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-12-07 14:46:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:51,061 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-12-07 14:46:51,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-12-07 14:46:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:46:51,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:51,063 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] [2019-12-07 14:46:51,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:46:51,264 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-12-07 14:46:51,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:51,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391653155] [2019-12-07 14:46:51,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:51,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:51,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:51,326 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:46:51,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391653155] [2019-12-07 14:46:51,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:51,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:46:51,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270549543] [2019-12-07 14:46:51,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:51,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:51,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:51,332 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-12-07 14:46:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:51,434 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-12-07 14:46:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:51,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 14:46:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:51,436 INFO L225 Difference]: With dead ends: 232 [2019-12-07 14:46:51,436 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 14:46:51,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-12-07 14:46:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 14:46:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-12-07 14:46:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 14:46:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-07 14:46:51,445 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-12-07 14:46:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:51,446 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-07 14:46:51,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-07 14:46:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:46:51,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:51,447 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:51,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:46:51,648 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-12-07 14:46:51,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:51,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749183749] [2019-12-07 14:46:51,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:51,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:51,739 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:46:51,747 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:46:51,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749183749] [2019-12-07 14:46:51,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:51,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:46:51,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144233250] [2019-12-07 14:46:51,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:51,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:51,754 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-12-07 14:46:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:51,846 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-12-07 14:46:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:51,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 14:46:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:51,848 INFO L225 Difference]: With dead ends: 264 [2019-12-07 14:46:51,848 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 14:46:51,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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-12-07 14:46:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 14:46:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-12-07 14:46:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 14:46:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-12-07 14:46:51,857 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-12-07 14:46:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:51,857 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-12-07 14:46:51,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-12-07 14:46:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:46:51,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:51,859 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:52,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:46:52,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:52,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-12-07 14:46:52,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173523574] [2019-12-07 14:46:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:52,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:52,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:46:52,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:46:52,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173523574] [2019-12-07 14:46:52,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:52,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:46:52,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963563198] [2019-12-07 14:46:52,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:52,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:52,199 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-12-07 14:46:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:52,218 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-12-07 14:46:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:52,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:46:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:52,220 INFO L225 Difference]: With dead ends: 298 [2019-12-07 14:46:52,220 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 14:46:52,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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-12-07 14:46:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 14:46:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 14:46:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 14:46:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-12-07 14:46:52,231 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-12-07 14:46:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:52,232 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-12-07 14:46:52,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-12-07 14:46:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:46:52,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:52,233 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:52,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:46:52,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-12-07 14:46:52,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:52,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919207574] [2019-12-07 14:46:52,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:52,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:52,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 14:46:52,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 14:46:52,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919207574] [2019-12-07 14:46:52,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:52,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:52,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348942231] [2019-12-07 14:46:52,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:52,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:52,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:52,545 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-12-07 14:46:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:52,731 INFO L93 Difference]: Finished difference Result 390 states and 587 transitions. [2019-12-07 14:46:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:52,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:46:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:52,733 INFO L225 Difference]: With dead ends: 390 [2019-12-07 14:46:52,733 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 14:46:52,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 14:46:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-12-07 14:46:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-07 14:46:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2019-12-07 14:46:52,743 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 66 [2019-12-07 14:46:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:52,744 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2019-12-07 14:46:52,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2019-12-07 14:46:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:46:52,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:52,746 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:52,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:46:52,947 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1464883036, now seen corresponding path program 1 times [2019-12-07 14:46:52,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536424890] [2019-12-07 14:46:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:53,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:53,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 14:46:53,090 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 14:46:53,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536424890] [2019-12-07 14:46:53,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:53,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:46:53,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146865759] [2019-12-07 14:46:53,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:53,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:53,098 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand 3 states. [2019-12-07 14:46:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:53,179 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2019-12-07 14:46:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:53,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 14:46:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:53,181 INFO L225 Difference]: With dead ends: 468 [2019-12-07 14:46:53,181 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 14:46:53,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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-12-07 14:46:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 14:46:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-12-07 14:46:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:46:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 347 transitions. [2019-12-07 14:46:53,188 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 347 transitions. Word has length 67 [2019-12-07 14:46:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:53,188 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 347 transitions. [2019-12-07 14:46:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 347 transitions. [2019-12-07 14:46:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 14:46:53,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:53,189 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:53,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:46:53,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1271135886, now seen corresponding path program 1 times [2019-12-07 14:46:53,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:53,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434498610] [2019-12-07 14:46:53,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:53,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:53,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 14:46:53,447 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 14:46:53,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434498610] [2019-12-07 14:46:53,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:53,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:46:53,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627394781] [2019-12-07 14:46:53,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:53,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:53,453 INFO L87 Difference]: Start difference. First operand 246 states and 347 transitions. Second operand 3 states. [2019-12-07 14:46:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:53,535 INFO L93 Difference]: Finished difference Result 507 states and 723 transitions. [2019-12-07 14:46:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:53,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 14:46:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:53,537 INFO L225 Difference]: With dead ends: 507 [2019-12-07 14:46:53,537 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 14:46:53,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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-12-07 14:46:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 14:46:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-12-07 14:46:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 14:46:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2019-12-07 14:46:53,544 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 83 [2019-12-07 14:46:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:53,544 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2019-12-07 14:46:53,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2019-12-07 14:46:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:46:53,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:53,545 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-12-07 14:46:53,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:46:53,746 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-12-07 14:46:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:53,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707479828] [2019-12-07 14:46:53,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:53,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:53,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 14:46:53,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 14:46:53,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707479828] [2019-12-07 14:46:53,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:53,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:53,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311300298] [2019-12-07 14:46:53,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:53,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:53,819 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand 4 states. [2019-12-07 14:46:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:53,856 INFO L93 Difference]: Finished difference Result 784 states and 1095 transitions. [2019-12-07 14:46:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:53,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:46:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:53,859 INFO L225 Difference]: With dead ends: 784 [2019-12-07 14:46:53,859 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 14:46:53,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 14:46:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-12-07 14:46:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-12-07 14:46:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2019-12-07 14:46:53,874 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 102 [2019-12-07 14:46:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:53,875 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2019-12-07 14:46:53,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2019-12-07 14:46:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 14:46:53,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:53,877 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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-12-07 14:46:54,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash 302681874, now seen corresponding path program 1 times [2019-12-07 14:46:54,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:54,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034508502] [2019-12-07 14:46:54,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:54,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:54,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 14:46:54,175 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 14:46:54,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034508502] [2019-12-07 14:46:54,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:54,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:46:54,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896621841] [2019-12-07 14:46:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:54,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:46:54,184 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand 3 states. [2019-12-07 14:46:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:54,203 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2019-12-07 14:46:54,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:54,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 14:46:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:54,206 INFO L225 Difference]: With dead ends: 1069 [2019-12-07 14:46:54,206 INFO L226 Difference]: Without dead ends: 552 [2019-12-07 14:46:54,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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-12-07 14:46:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-07 14:46:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-12-07 14:46:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-12-07 14:46:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 761 transitions. [2019-12-07 14:46:54,217 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 761 transitions. Word has length 103 [2019-12-07 14:46:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:54,218 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 761 transitions. [2019-12-07 14:46:54,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 761 transitions. [2019-12-07 14:46:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 14:46:54,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:54,219 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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, 1] [2019-12-07 14:46:54,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-12-07 14:46:54,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:54,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687044313] [2019-12-07 14:46:54,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:54,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:54,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 14:46:54,480 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 14:46:54,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687044313] [2019-12-07 14:46:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:54,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:54,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449047309] [2019-12-07 14:46:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:54,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:54,491 INFO L87 Difference]: Start difference. First operand 552 states and 761 transitions. Second operand 4 states. [2019-12-07 14:46:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:54,549 INFO L93 Difference]: Finished difference Result 1519 states and 2112 transitions. [2019-12-07 14:46:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:54,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 14:46:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:54,555 INFO L225 Difference]: With dead ends: 1519 [2019-12-07 14:46:54,556 INFO L226 Difference]: Without dead ends: 1002 [2019-12-07 14:46:54,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-07 14:46:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-12-07 14:46:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-07 14:46:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1391 transitions. [2019-12-07 14:46:54,577 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1391 transitions. Word has length 104 [2019-12-07 14:46:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:54,577 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1391 transitions. [2019-12-07 14:46:54,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1391 transitions. [2019-12-07 14:46:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:46:54,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:54,580 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:54,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,781 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-12-07 14:46:54,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:54,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739119737] [2019-12-07 14:46:54,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:54,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:54,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 14:46:54,873 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 14:46:54,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739119737] [2019-12-07 14:46:54,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:54,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:54,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212852661] [2019-12-07 14:46:54,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:54,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:54,907 INFO L87 Difference]: Start difference. First operand 1002 states and 1391 transitions. Second operand 4 states. [2019-12-07 14:46:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:55,084 INFO L93 Difference]: Finished difference Result 2090 states and 2937 transitions. [2019-12-07 14:46:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:55,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 14:46:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:55,091 INFO L225 Difference]: With dead ends: 2090 [2019-12-07 14:46:55,091 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 14:46:55,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 14:46:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2019-12-07 14:46:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-12-07 14:46:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1499 transitions. [2019-12-07 14:46:55,125 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1499 transitions. Word has length 172 [2019-12-07 14:46:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:55,125 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1499 transitions. [2019-12-07 14:46:55,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1499 transitions. [2019-12-07 14:46:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 14:46:55,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:55,128 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:55,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:46:55,328 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-12-07 14:46:55,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:55,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367860870] [2019-12-07 14:46:55,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:55,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:46:55,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 456 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:55,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 440 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:55,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367860870] [2019-12-07 14:46:55,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556890054] [2019-12-07 14:46:55,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:46:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:55,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:55,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:46:55,610 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:46:55,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:46:55,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5] total 9 [2019-12-07 14:46:55,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162494309] [2019-12-07 14:46:55,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:46:55,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:46:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:46:55,644 INFO L87 Difference]: Start difference. First operand 1094 states and 1499 transitions. Second operand 3 states. [2019-12-07 14:46:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:55,681 INFO L93 Difference]: Finished difference Result 2408 states and 3303 transitions. [2019-12-07 14:46:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:46:55,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 14:46:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:55,688 INFO L225 Difference]: With dead ends: 2408 [2019-12-07 14:46:55,689 INFO L226 Difference]: Without dead ends: 1349 [2019-12-07 14:46:55,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:46:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-12-07 14:46:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2019-12-07 14:46:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-12-07 14:46:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1846 transitions. [2019-12-07 14:46:55,716 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1846 transitions. Word has length 193 [2019-12-07 14:46:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:55,717 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 1846 transitions. [2019-12-07 14:46:55,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:46:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1846 transitions. [2019-12-07 14:46:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 14:46:55,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:55,720 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:56,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:46:56,121 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-12-07 14:46:56,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:56,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331111813] [2019-12-07 14:46:56,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:56,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:46:56,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,229 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331111813] [2019-12-07 14:46:56,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543714980] [2019-12-07 14:46:56,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:46:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:56,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:46:56,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,523 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047008455] [2019-12-07 14:46:56,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:56,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:46:56,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,641 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 14:46:56,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:46:56,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2019-12-07 14:46:56,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398712715] [2019-12-07 14:46:56,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:46:56,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:46:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:46:56,670 INFO L87 Difference]: Start difference. First operand 1349 states and 1846 transitions. Second operand 8 states. [2019-12-07 14:46:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:57,051 INFO L93 Difference]: Finished difference Result 3071 states and 4243 transitions. [2019-12-07 14:46:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:46:57,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-12-07 14:46:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:57,058 INFO L225 Difference]: With dead ends: 3071 [2019-12-07 14:46:57,059 INFO L226 Difference]: Without dead ends: 1778 [2019-12-07 14:46:57,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1161 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:46:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-07 14:46:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1662. [2019-12-07 14:46:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-12-07 14:46:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2263 transitions. [2019-12-07 14:46:57,091 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2263 transitions. Word has length 195 [2019-12-07 14:46:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:57,092 INFO L462 AbstractCegarLoop]: Abstraction has 1662 states and 2263 transitions. [2019-12-07 14:46:57,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:46:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2263 transitions. [2019-12-07 14:46:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 14:46:57,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:57,095 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 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-12-07 14:46:57,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:46:57,696 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:57,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1241778267, now seen corresponding path program 1 times [2019-12-07 14:46:57,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:57,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543905741] [2019-12-07 14:46:57,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:57,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:57,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-12-07 14:46:57,794 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-12-07 14:46:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543905741] [2019-12-07 14:46:57,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:57,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507020063] [2019-12-07 14:46:57,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:57,830 INFO L87 Difference]: Start difference. First operand 1662 states and 2263 transitions. Second operand 4 states. [2019-12-07 14:46:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:57,990 INFO L93 Difference]: Finished difference Result 3472 states and 4787 transitions. [2019-12-07 14:46:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:57,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-12-07 14:46:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:58,000 INFO L225 Difference]: With dead ends: 3472 [2019-12-07 14:46:58,000 INFO L226 Difference]: Without dead ends: 1866 [2019-12-07 14:46:58,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-07 14:46:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1830. [2019-12-07 14:46:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1830 states. [2019-12-07 14:46:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2455 transitions. [2019-12-07 14:46:58,040 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2455 transitions. Word has length 220 [2019-12-07 14:46:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:58,040 INFO L462 AbstractCegarLoop]: Abstraction has 1830 states and 2455 transitions. [2019-12-07 14:46:58,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2455 transitions. [2019-12-07 14:46:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-12-07 14:46:58,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:58,044 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:46:58,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:46:58,245 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1291955765, now seen corresponding path program 1 times [2019-12-07 14:46:58,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:58,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804234907] [2019-12-07 14:46:58,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:58,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:58,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 14:46:58,463 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 14:46:58,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804234907] [2019-12-07 14:46:58,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:58,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:58,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437337411] [2019-12-07 14:46:58,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:58,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:58,492 INFO L87 Difference]: Start difference. First operand 1830 states and 2455 transitions. Second operand 4 states. [2019-12-07 14:46:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:58,635 INFO L93 Difference]: Finished difference Result 3808 states and 5191 transitions. [2019-12-07 14:46:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:58,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-12-07 14:46:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:58,642 INFO L225 Difference]: With dead ends: 3808 [2019-12-07 14:46:58,642 INFO L226 Difference]: Without dead ends: 2034 [2019-12-07 14:46:58,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-12-07 14:46:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2016. [2019-12-07 14:46:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-12-07 14:46:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2665 transitions. [2019-12-07 14:46:58,677 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2665 transitions. Word has length 231 [2019-12-07 14:46:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:58,677 INFO L462 AbstractCegarLoop]: Abstraction has 2016 states and 2665 transitions. [2019-12-07 14:46:58,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2665 transitions. [2019-12-07 14:46:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-12-07 14:46:58,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:58,681 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:58,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:46:58,882 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1875116247, now seen corresponding path program 1 times [2019-12-07 14:46:58,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:58,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217493744] [2019-12-07 14:46:58,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:58,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:58,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-12-07 14:46:59,022 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-12-07 14:46:59,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217493744] [2019-12-07 14:46:59,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:59,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:59,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028089063] [2019-12-07 14:46:59,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:59,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:59,066 INFO L87 Difference]: Start difference. First operand 2016 states and 2665 transitions. Second operand 4 states. [2019-12-07 14:46:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:59,220 INFO L93 Difference]: Finished difference Result 4258 states and 5713 transitions. [2019-12-07 14:46:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:59,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-12-07 14:46:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:59,227 INFO L225 Difference]: With dead ends: 4258 [2019-12-07 14:46:59,227 INFO L226 Difference]: Without dead ends: 2298 [2019-12-07 14:46:59,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2019-12-07 14:46:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2238. [2019-12-07 14:46:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2019-12-07 14:46:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 2911 transitions. [2019-12-07 14:46:59,276 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 2911 transitions. Word has length 261 [2019-12-07 14:46:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 2238 states and 2911 transitions. [2019-12-07 14:46:59,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2911 transitions. [2019-12-07 14:46:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-07 14:46:59,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:59,281 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:46:59,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:46:59,482 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:46:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:46:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash -362194243, now seen corresponding path program 1 times [2019-12-07 14:46:59,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:46:59,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068915330] [2019-12-07 14:46:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:46:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:46:59,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:46:59,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:46:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 14:46:59,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:46:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 14:46:59,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068915330] [2019-12-07 14:46:59,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:46:59,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:46:59,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092447153] [2019-12-07 14:46:59,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:46:59,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:46:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:46:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:59,730 INFO L87 Difference]: Start difference. First operand 2238 states and 2911 transitions. Second operand 4 states. [2019-12-07 14:46:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:46:59,802 INFO L93 Difference]: Finished difference Result 8586 states and 11197 transitions. [2019-12-07 14:46:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:46:59,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-12-07 14:46:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:46:59,829 INFO L225 Difference]: With dead ends: 8586 [2019-12-07 14:46:59,830 INFO L226 Difference]: Without dead ends: 6404 [2019-12-07 14:46:59,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:46:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2019-12-07 14:46:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 6400. [2019-12-07 14:46:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6400 states. [2019-12-07 14:46:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6400 states to 6400 states and 8339 transitions. [2019-12-07 14:46:59,942 INFO L78 Accepts]: Start accepts. Automaton has 6400 states and 8339 transitions. Word has length 262 [2019-12-07 14:46:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:46:59,943 INFO L462 AbstractCegarLoop]: Abstraction has 6400 states and 8339 transitions. [2019-12-07 14:46:59,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:46:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6400 states and 8339 transitions. [2019-12-07 14:46:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-12-07 14:46:59,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:46:59,949 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:47:00,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 14:47:00,150 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1596519917, now seen corresponding path program 1 times [2019-12-07 14:47:00,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:00,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672381108] [2019-12-07 14:47:00,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:00,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:00,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-12-07 14:47:00,377 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-12-07 14:47:00,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672381108] [2019-12-07 14:47:00,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:00,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:47:00,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897843773] [2019-12-07 14:47:00,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:47:00,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:47:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:00,428 INFO L87 Difference]: Start difference. First operand 6400 states and 8339 transitions. Second operand 4 states. [2019-12-07 14:47:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:00,611 INFO L93 Difference]: Finished difference Result 13122 states and 17163 transitions. [2019-12-07 14:47:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:47:00,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-12-07 14:47:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:00,634 INFO L225 Difference]: With dead ends: 13122 [2019-12-07 14:47:00,634 INFO L226 Difference]: Without dead ends: 6778 [2019-12-07 14:47:00,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6778 states. [2019-12-07 14:47:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6778 to 6598. [2019-12-07 14:47:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6598 states. [2019-12-07 14:47:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6598 states to 6598 states and 8549 transitions. [2019-12-07 14:47:00,733 INFO L78 Accepts]: Start accepts. Automaton has 6598 states and 8549 transitions. Word has length 286 [2019-12-07 14:47:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:00,733 INFO L462 AbstractCegarLoop]: Abstraction has 6598 states and 8549 transitions. [2019-12-07 14:47:00,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:47:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6598 states and 8549 transitions. [2019-12-07 14:47:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-12-07 14:47:00,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:00,739 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:47:00,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 14:47:00,940 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -49494058, now seen corresponding path program 1 times [2019-12-07 14:47:00,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:00,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744218685] [2019-12-07 14:47:00,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:01,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:01,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-12-07 14:47:01,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-12-07 14:47:01,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744218685] [2019-12-07 14:47:01,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:01,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:47:01,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957696056] [2019-12-07 14:47:01,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:47:01,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:01,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:47:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:01,090 INFO L87 Difference]: Start difference. First operand 6598 states and 8549 transitions. Second operand 4 states. [2019-12-07 14:47:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:01,321 INFO L93 Difference]: Finished difference Result 13986 states and 18393 transitions. [2019-12-07 14:47:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:47:01,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-12-07 14:47:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:01,334 INFO L225 Difference]: With dead ends: 13986 [2019-12-07 14:47:01,334 INFO L226 Difference]: Without dead ends: 7444 [2019-12-07 14:47:01,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2019-12-07 14:47:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 7264. [2019-12-07 14:47:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7264 states. [2019-12-07 14:47:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 9287 transitions. [2019-12-07 14:47:01,437 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 9287 transitions. Word has length 298 [2019-12-07 14:47:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:01,437 INFO L462 AbstractCegarLoop]: Abstraction has 7264 states and 9287 transitions. [2019-12-07 14:47:01,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:47:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 9287 transitions. [2019-12-07 14:47:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 14:47:01,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:01,444 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:47:01,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 14:47:01,645 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:01,645 INFO L82 PathProgramCache]: Analyzing trace with hash -549291359, now seen corresponding path program 1 times [2019-12-07 14:47:01,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:01,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753268784] [2019-12-07 14:47:01,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:01,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:01,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-12-07 14:47:01,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-12-07 14:47:01,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753268784] [2019-12-07 14:47:01,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:01,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:47:01,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817802613] [2019-12-07 14:47:01,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:47:01,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:47:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:01,823 INFO L87 Difference]: Start difference. First operand 7264 states and 9287 transitions. Second operand 4 states. [2019-12-07 14:47:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:02,026 INFO L93 Difference]: Finished difference Result 15372 states and 19959 transitions. [2019-12-07 14:47:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:47:02,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-12-07 14:47:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:02,038 INFO L225 Difference]: With dead ends: 15372 [2019-12-07 14:47:02,038 INFO L226 Difference]: Without dead ends: 8164 [2019-12-07 14:47:02,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8164 states. [2019-12-07 14:47:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8164 to 8002. [2019-12-07 14:47:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8002 states. [2019-12-07 14:47:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 10097 transitions. [2019-12-07 14:47:02,182 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 10097 transitions. Word has length 335 [2019-12-07 14:47:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:02,182 INFO L462 AbstractCegarLoop]: Abstraction has 8002 states and 10097 transitions. [2019-12-07 14:47:02,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:47:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 10097 transitions. [2019-12-07 14:47:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-12-07 14:47:02,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:02,190 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:47:02,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 14:47:02,392 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1440496778, now seen corresponding path program 1 times [2019-12-07 14:47:02,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:02,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892192609] [2019-12-07 14:47:02,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:02,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:02,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:02,576 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:02,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892192609] [2019-12-07 14:47:02,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749317177] [2019-12-07 14:47:02,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:47:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:02,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:02,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:02,791 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:02,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384663737] [2019-12-07 14:47:02,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:47:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:02,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:02,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:02,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 14:47:03,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:47:03,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2019-12-07 14:47:03,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547198959] [2019-12-07 14:47:03,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:47:03,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:47:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:47:03,054 INFO L87 Difference]: Start difference. First operand 8002 states and 10097 transitions. Second operand 6 states. [2019-12-07 14:47:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:03,636 INFO L93 Difference]: Finished difference Result 25705 states and 32510 transitions. [2019-12-07 14:47:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:47:03,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2019-12-07 14:47:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:03,652 INFO L225 Difference]: With dead ends: 25705 [2019-12-07 14:47:03,652 INFO L226 Difference]: Without dead ends: 17759 [2019-12-07 14:47:03,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2150 GetRequests, 2142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:47:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17759 states. [2019-12-07 14:47:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17759 to 10929. [2019-12-07 14:47:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10929 states. [2019-12-07 14:47:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10929 states to 10929 states and 13967 transitions. [2019-12-07 14:47:03,853 INFO L78 Accepts]: Start accepts. Automaton has 10929 states and 13967 transitions. Word has length 358 [2019-12-07 14:47:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:03,854 INFO L462 AbstractCegarLoop]: Abstraction has 10929 states and 13967 transitions. [2019-12-07 14:47:03,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:47:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 10929 states and 13967 transitions. [2019-12-07 14:47:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-12-07 14:47:03,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:03,864 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:47:04,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 14:47:04,466 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:04,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1178954401, now seen corresponding path program 1 times [2019-12-07 14:47:04,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:04,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195816510] [2019-12-07 14:47:04,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:04,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:04,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-12-07 14:47:04,608 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-12-07 14:47:04,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195816510] [2019-12-07 14:47:04,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:04,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:47:04,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918994340] [2019-12-07 14:47:04,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:47:04,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:47:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:47:04,675 INFO L87 Difference]: Start difference. First operand 10929 states and 13967 transitions. Second operand 3 states. [2019-12-07 14:47:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:04,807 INFO L93 Difference]: Finished difference Result 22760 states and 28696 transitions. [2019-12-07 14:47:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:47:04,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2019-12-07 14:47:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:04,816 INFO L225 Difference]: With dead ends: 22760 [2019-12-07 14:47:04,816 INFO L226 Difference]: Without dead ends: 11887 [2019-12-07 14:47:04,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 717 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-12-07 14:47:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2019-12-07 14:47:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 11328. [2019-12-07 14:47:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11328 states. [2019-12-07 14:47:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 14111 transitions. [2019-12-07 14:47:04,999 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 14111 transitions. Word has length 360 [2019-12-07 14:47:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:04,999 INFO L462 AbstractCegarLoop]: Abstraction has 11328 states and 14111 transitions. [2019-12-07 14:47:04,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:47:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 14111 transitions. [2019-12-07 14:47:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 14:47:05,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:05,013 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 11, 11, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:47:05,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 14:47:05,214 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1353488943, now seen corresponding path program 1 times [2019-12-07 14:47:05,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:05,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158957080] [2019-12-07 14:47:05,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:05,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:05,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-12-07 14:47:05,541 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-12-07 14:47:05,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158957080] [2019-12-07 14:47:05,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:05,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:47:05,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178033344] [2019-12-07 14:47:05,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:47:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:47:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:47:05,666 INFO L87 Difference]: Start difference. First operand 11328 states and 14111 transitions. Second operand 3 states. [2019-12-07 14:47:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:05,787 INFO L93 Difference]: Finished difference Result 17798 states and 22218 transitions. [2019-12-07 14:47:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:47:05,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-12-07 14:47:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:05,792 INFO L225 Difference]: With dead ends: 17798 [2019-12-07 14:47:05,792 INFO L226 Difference]: Without dead ends: 7731 [2019-12-07 14:47:05,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 863 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-12-07 14:47:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2019-12-07 14:47:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7729. [2019-12-07 14:47:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-07 14:47:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 9710 transitions. [2019-12-07 14:47:05,905 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 9710 transitions. Word has length 433 [2019-12-07 14:47:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:05,905 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 9710 transitions. [2019-12-07 14:47:05,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:47:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 9710 transitions. [2019-12-07 14:47:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-12-07 14:47:05,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:05,914 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 14, 14, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:47:06,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 14:47:06,115 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1635223835, now seen corresponding path program 1 times [2019-12-07 14:47:06,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:06,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311842533] [2019-12-07 14:47:06,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:06,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:47:06,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-12-07 14:47:06,511 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-12-07 14:47:06,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311842533] [2019-12-07 14:47:06,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:06,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:47:06,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389446694] [2019-12-07 14:47:06,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:47:06,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:47:06,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:06,632 INFO L87 Difference]: Start difference. First operand 7729 states and 9710 transitions. Second operand 4 states. [2019-12-07 14:47:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:06,838 INFO L93 Difference]: Finished difference Result 15780 states and 20040 transitions. [2019-12-07 14:47:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:47:06,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 543 [2019-12-07 14:47:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:06,843 INFO L225 Difference]: With dead ends: 15780 [2019-12-07 14:47:06,843 INFO L226 Difference]: Without dead ends: 7351 [2019-12-07 14:47:06,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:47:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-12-07 14:47:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 7297. [2019-12-07 14:47:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7297 states. [2019-12-07 14:47:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7297 states to 7297 states and 9062 transitions. [2019-12-07 14:47:06,953 INFO L78 Accepts]: Start accepts. Automaton has 7297 states and 9062 transitions. Word has length 543 [2019-12-07 14:47:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:06,953 INFO L462 AbstractCegarLoop]: Abstraction has 7297 states and 9062 transitions. [2019-12-07 14:47:06,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:47:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7297 states and 9062 transitions. [2019-12-07 14:47:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-12-07 14:47:06,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:06,959 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:47:07,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 14:47:07,160 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1765106863, now seen corresponding path program 1 times [2019-12-07 14:47:07,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:47:07,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355490948] [2019-12-07 14:47:07,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:07,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:07,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:07,505 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:07,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355490948] [2019-12-07 14:47:07,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1559895204] [2019-12-07 14:47:07,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:47:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:07,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:07,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:08,004 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:08,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993173131] [2019-12-07 14:47:08,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:47:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:08,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:08,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:08,490 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-12-07 14:47:08,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:47:08,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2019-12-07 14:47:08,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915965917] [2019-12-07 14:47:08,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:47:08,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:47:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:47:08,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:47:08,654 INFO L87 Difference]: Start difference. First operand 7297 states and 9062 transitions. Second operand 6 states. [2019-12-07 14:47:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:08,830 INFO L93 Difference]: Finished difference Result 7510 states and 9332 transitions. [2019-12-07 14:47:08,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:47:08,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 618 [2019-12-07 14:47:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:08,831 INFO L225 Difference]: With dead ends: 7510 [2019-12-07 14:47:08,831 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:47:08,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3706 GetRequests, 3700 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:47:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:47:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:47:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:47:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:47:08,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 618 [2019-12-07 14:47:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:08,833 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:47:08,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:47:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:47:08,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:47:09,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 mathsat -unsat_core_generation=3,32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:47:09,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:47:09,595 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2019-12-07 14:47:10,079 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 545 DAG size of output: 187 [2019-12-07 14:47:10,430 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 64 [2019-12-07 14:47:10,541 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-12-07 14:47:10,716 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-12-07 14:47:10,832 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-12-07 14:47:11,042 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2019-12-07 14:47:11,176 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-12-07 14:47:11,582 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2019-12-07 14:47:11,720 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-07 14:47:12,207 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 64 [2019-12-07 14:47:12,370 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-07 14:47:13,506 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 152 DAG size of output: 114 [2019-12-07 14:47:14,128 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-12-07 14:47:14,511 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-07 14:47:14,514 INFO L249 CegarLoopResult]: At program point L597(lines 92 598) the Hoare annotation is: true [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L168(lines 168 541) no Hoare annotation was computed. [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L135(lines 135 552) no Hoare annotation was computed. [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L102(lines 102 563) no Hoare annotation was computed. [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L367(lines 367 371) no Hoare annotation was computed. [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L367-2(lines 367 371) no Hoare annotation was computed. [2019-12-07 14:47:14,514 INFO L246 CegarLoopResult]: For program point L301-1(lines 301 315) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L242 CegarLoopResult]: At program point L202(lines 99 564) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)))) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) [2019-12-07 14:47:14,515 INFO L242 CegarLoopResult]: At program point L169(lines 165 542) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 .cse8 .cse9 .cse10 .cse0 .cse3 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L566(lines 566 594) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L567(lines 567 591) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L501-1(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L336(lines 336 341) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L171(lines 171 540) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L138(lines 138 551) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L105(lines 105 562) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L568(lines 568 577) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-12-07 14:47:14,515 INFO L246 CegarLoopResult]: For program point L568-2(lines 567 589) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L242 CegarLoopResult]: At program point L139(lines 135 552) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse8 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L305-2(lines 303 315) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L570(lines 570 574) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L438(lines 438 443) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L273(lines 273 277) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L174(lines 174 539) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L141(lines 141 550) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L207-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L108(lines 108 561) no Hoare annotation was computed. [2019-12-07 14:47:14,516 INFO L246 CegarLoopResult]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L242 CegarLoopResult]: At program point L175(lines 171 540) the Hoare annotation is: (let ((.cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse9 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse10 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse11 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not .cse1) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse6 .cse8 .cse9 .cse11) (and .cse1 .cse2 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse8 .cse9 .cse10 .cse11 .cse0 .cse3 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L506-1(lines 506 510) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L243(lines 243 248) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L177(lines 177 538) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L144(lines 144 549) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L111(lines 111 560) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L242 CegarLoopResult]: At program point L145(lines 141 550) the Hoare annotation is: (let ((.cse8 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse10 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse10 .cse5 .cse6 .cse7))) [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L180(lines 180 537) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L147(lines 147 548) no Hoare annotation was computed. [2019-12-07 14:47:14,517 INFO L246 CegarLoopResult]: For program point L114(lines 114 559) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L242 CegarLoopResult]: At program point L181(lines 177 538) the Hoare annotation is: (let ((.cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse9 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse10 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse11 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not .cse1) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse6 .cse8 .cse9 .cse11) (and .cse1 .cse2 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse8 .cse9 .cse10 .cse11 .cse0 .cse3 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,518 INFO L242 CegarLoopResult]: At program point L115(lines 111 560) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)))) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) [2019-12-07 14:47:14,518 INFO L242 CegarLoopResult]: At program point L347(lines 65 614) the Hoare annotation is: false [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L249 CegarLoopResult]: At program point L612(lines 65 614) the Hoare annotation is: true [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L282-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L183(lines 183 536) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L150(lines 150 547) no Hoare annotation was computed. [2019-12-07 14:47:14,518 INFO L246 CegarLoopResult]: For program point L117(lines 117 558) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L249 CegarLoopResult]: At program point L613(lines 8 615) the Hoare annotation is: true [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L448(lines 448 452) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L351(lines 351 355) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L219(lines 219 236) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L186(lines 186 535) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L153(lines 153 546) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L219-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L120(lines 120 557) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L242 CegarLoopResult]: At program point L187(lines 183 536) the Hoare annotation is: (let ((.cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse11 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse12 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse1 .cse10 .cse3 .cse4 .cse6 .cse7 .cse8 .cse11 .cse9 .cse0 .cse2 .cse12) (and .cse5 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse10 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 .cse8 .cse11 .cse9 .cse0 .cse2 .cse12 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,519 INFO L242 CegarLoopResult]: At program point L121(lines 117 558) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse10 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse5 .cse6 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7) (and .cse8 .cse1 .cse9 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse10 .cse7 .cse0 .cse2 .cse11) (and .cse8 .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse9 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 .cse10 .cse7 .cse0 .cse2 .cse11 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L485-1(lines 485 497) no Hoare annotation was computed. [2019-12-07 14:47:14,519 INFO L246 CegarLoopResult]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L221(lines 221 226) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L189(lines 189 534) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L156(lines 156 545) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L123(lines 123 556) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L242 CegarLoopResult]: At program point L190(lines 189 534) the Hoare annotation is: (let ((.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (or (and .cse0 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4) (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32))) .cse2 (not .cse0) .cse5))) [2019-12-07 14:47:14,520 INFO L242 CegarLoopResult]: At program point L157(lines 147 548) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse8 .cse9 .cse10 .cse0 .cse3 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L488(lines 488 493) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L455(lines 455 466) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L455-1(lines 455 466) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L257(lines 257 265) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L323-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-12-07 14:47:14,520 INFO L246 CegarLoopResult]: For program point L192(lines 192 533) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L159(lines 159 544) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L126(lines 126 555) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L93-1(lines 65 614) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L457(lines 457 463) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L249 CegarLoopResult]: At program point L193(lines 192 533) the Hoare annotation is: true [2019-12-07 14:47:14,521 INFO L242 CegarLoopResult]: At program point L127(lines 123 556) the Hoare annotation is: (let ((.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse1 .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse7 .cse8 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (and .cse7 .cse0 .cse1 .cse8 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6))) [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L260(lines 260 264) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L260-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L249 CegarLoopResult]: At program point L624(lines 616 626) the Hoare annotation is: true [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L162(lines 162 543) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L129(lines 129 554) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L96(lines 96 565) no Hoare annotation was computed. [2019-12-07 14:47:14,521 INFO L246 CegarLoopResult]: For program point L427(lines 427 431) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L427-2(lines 197 529) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L249 CegarLoopResult]: At program point L196(lines 195 532) the Hoare annotation is: true [2019-12-07 14:47:14,522 INFO L242 CegarLoopResult]: At program point L163(lines 159 544) the Hoare annotation is: (let ((.cse8 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse10 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse10 .cse5 .cse6 .cse7))) [2019-12-07 14:47:14,522 INFO L242 CegarLoopResult]: At program point L97(lines 96 565) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L396(lines 396 401) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L396-2(lines 396 401) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L165(lines 165 542) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L132(lines 132 553) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L246 CegarLoopResult]: For program point L99(lines 99 564) no Hoare annotation was computed. [2019-12-07 14:47:14,522 INFO L242 CegarLoopResult]: At program point L133(lines 129 554) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse8 .cse9))) [2019-12-07 14:47:14,523 INFO L242 CegarLoopResult]: At program point L530(lines 93 596) the Hoare annotation is: (let ((.cse27 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32)))) (let ((.cse5 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse14 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (= (_ bv4448 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse17 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse16 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse18 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse12 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse7 (not .cse0)) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse13 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (not (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse20 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse22 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse23 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32))))) (.cse10 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse24 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse25 (not (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32))))) (.cse3 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse26 (not .cse27)) (.cse19 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse21 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse11 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse7 .cse1 .cse8) (and .cse7 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse5 .cse7 .cse1) (and .cse0 .cse9 .cse5 .cse10 .cse2 .cse11 .cse3) (and .cse0 .cse12 .cse10 .cse11 .cse3) (and .cse1 .cse2 .cse13 .cse3) (and .cse0 .cse14 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse10 .cse15 .cse2 .cse11 .cse8 .cse3) (and .cse0 .cse9 .cse14 .cse10 .cse2 .cse11 .cse3) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse11 .cse3) (and .cse0 .cse16 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse17 .cse3) (and .cse0 .cse9 .cse10 .cse2 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse18) (and .cse0 .cse9 .cse10 .cse2 .cse17 .cse11 .cse3) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse15) (and .cse0 .cse16 .cse9 .cse10 .cse2 .cse11 .cse3) (and .cse0 .cse9 .cse10 .cse2 .cse11 .cse3 .cse18) (and .cse19 .cse0 .cse20 .cse21 .cse22 .cse23 .cse1 .cse24 .cse2 .cse25 .cse3 .cse26) (and .cse0 .cse12 .cse1 .cse3) (and .cse9 .cse6 .cse7 .cse2 .cse11 .cse8 .cse3) (and (= (_ bv0 32) (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32))) (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse1) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse27) (and .cse7 .cse1 .cse13) (and .cse0 .cse9 .cse20 .cse22 .cse23 .cse10 .cse24 .cse25 .cse3 .cse26 .cse19 .cse21 .cse2 .cse11)))) [2019-12-07 14:47:14,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:47:14 BoogieIcfgContainer [2019-12-07 14:47:14,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:47:14,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:47:14,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:47:14,550 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:47:14,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:46:50" (3/4) ... [2019-12-07 14:47:14,553 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:47:14,563 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 14:47:14,564 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:47:14,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9bbb1c21-5952-4589-aa3b-26552d0a2256/bin/utaipan/witness.graphml [2019-12-07 14:47:14,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:47:14,630 INFO L168 Benchmark]: Toolchain (without parser) took 24629.85 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 953.7 MB in the beginning and 1.9 GB in the end (delta: -976.4 MB). Peak memory consumption was 343.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:47:14,630 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:47:14,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:47:14,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.14 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-12-07 14:47:14,631 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 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-12-07 14:47:14,631 INFO L168 Benchmark]: RCFGBuilder took 405.09 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:47:14,631 INFO L168 Benchmark]: TraceAbstraction took 23826.24 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -858.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 14:47:14,632 INFO L168 Benchmark]: Witness Printer took 79.39 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:47:14,633 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.14 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 27.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.09 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23826.24 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -858.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 79.39 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state))) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X)) || ((((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32)) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) || (((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((0bv32 == ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) && 4352bv32 == s__state) && !(s__hit == 0bv32)) && 2bv32 == blastFlag) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(4432bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) || (((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && !(4368bv32 == s__state))) || (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0bv32 == ~bvadd64(s__state, 4294955004bv32) && 0bv32 == blastFlag - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4448bv32 == s__state) || (((4528bv32 == s__state && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((~bvadd64(s__state, 4294967293bv32) == 0bv32 && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(4368bv32 == s__s3__tmp__next_state___0))) || ((!(s__hit == 0bv32) && 4560bv32 == s__state) && 2bv32 == blastFlag)) || ((4528bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4528bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 4416bv32 == s__state) && !(5bv32 == blastFlag)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || (((2bv32 == blastFlag && 65535bv32 == ag_X) && 4512bv32 == s__state) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 4480bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 4400bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4480bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 4512bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 4496bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 4464bv32 == s__state) && 61087bv32 == ag_Y)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && 4448bv32 == s__state)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4432bv32 == s__state)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && 4464bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || (1bv32 == blastFlag && 4384bv32 == s__state)) || ((s__hit == 0bv32 && 2bv32 == blastFlag) && 4400bv32 == s__state)) || ((((((s__hit == 0bv32 && 4496bv32 == s__state) && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y)) || ((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && 4432bv32 == s__state)) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state))) || (((s__hit == 0bv32 && 4416bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y)) || ((((((!(3bv32 == blastFlag) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && !(s__hit == 0bv32)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y)) || (((0bv32 == ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) && 4352bv32 == s__state) && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (0bv32 == blastFlag && 4368bv32 == s__state)) || ((!(s__hit == 0bv32) && 2bv32 == blastFlag) && 4512bv32 == s__state)) || (((((((((((((s__hit == 0bv32 && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((!(4099bv32 == s__state) && !(4432bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 1bv32 == blastFlag) && !(4368bv32 == s__state)) || ((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X)) || ((((((((((((((s__hit == 0bv32 && !(4432bv32 == s__state)) && !(3bv32 == blastFlag)) && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(0bv32 == ~bvadd64(s__state, 4294955004bv32))) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(0bv32 == ~bvadd64(s__state, 4294946816bv32))) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: SAFE, OverallTime: 18.6s, OverallIterations: 25, TraceHistogramMax: 22, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, HoareTripleCheckerStatistics: 4624 SDtfs, 3756 SDslu, 4173 SDs, 0 SdLazy, 3761 SolverSat, 660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15950 GetRequests, 15887 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11328occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 8253 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 281 NumberOfFragments, 2176 HoareAnnotationTreeSize, 23 FomulaSimplifications, 22336 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 23 FomulaSimplificationsInter, 16015 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 7998 NumberOfCodeBlocks, 7998 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 15932 ConstructedInterpolants, 0 QuantifiedInterpolants, 8211533 SizeOfPredicates, 37 NumberOfNonLiveVariables, 10182 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 64 InterpolantComputations, 44 PerfectInterpolantSequences, 70588/70956 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 correct! Received shutdown request...