./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/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 09d651c8899349531493fefbd169797d0022b4a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/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 09d651c8899349531493fefbd169797d0022b4a3 .................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:57:29,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:57:29,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:57:29,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:57:29,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:57:29,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:57:29,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:57:29,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:57:29,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:57:29,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:57:29,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:57:29,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:57:29,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:57:29,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:57:29,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:57:29,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:57:29,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:57:29,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:57:29,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:57:29,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:57:29,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:57:29,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:57:29,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:57:29,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:57:29,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:57:29,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:57:29,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:57:29,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:57:29,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:57:29,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:57:29,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:57:29,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:57:29,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:57:29,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:57:29,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:57:29,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:57:29,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:57:29,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:57:29,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:57:29,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:57:29,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:57:29,557 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:57:29,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:57:29,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:57:29,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:57:29,581 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:57:29,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:57:29,581 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:57:29,582 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:57:29,582 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:57:29,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:57:29,582 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:57:29,583 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:57:29,583 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:57:29,584 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:57:29,584 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:57:29,584 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:57:29,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:57:29,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:57:29,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:57:29,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:57:29,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:57:29,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:57:29,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:57:29,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:57:29,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:57:29,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:57:29,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:57:29,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:57:29,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:57:29,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:57:29,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:29,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:57:29,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:57:29,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:57:29,588 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:57:29,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:57:29,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:57:29,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:57:29,589 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_6aa65482-855a-4062-ac10-056623b68923/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-26 02:57:29,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:57:29,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:57:29,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:57:29,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:57:29,757 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:57:29,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-26 02:57:29,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/b2e722985/c8a3b20ad88841d1b63706ee25f77a03/FLAG00470fe73 [2019-11-26 02:57:30,365 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:57:30,366 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-26 02:57:30,389 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/b2e722985/c8a3b20ad88841d1b63706ee25f77a03/FLAG00470fe73 [2019-11-26 02:57:30,775 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/b2e722985/c8a3b20ad88841d1b63706ee25f77a03 [2019-11-26 02:57:30,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:57:30,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:57:30,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:30,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:57:30,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:57:30,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:30" (1/1) ... [2019-11-26 02:57:30,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcea06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:30, skipping insertion in model container [2019-11-26 02:57:30,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:30" (1/1) ... [2019-11-26 02:57:30,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:57:30,850 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:31,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:31,312 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:57:31,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:31,424 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:57:31,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31 WrapperNode [2019-11-26 02:57:31,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:31,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:31,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:57:31,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:57:31,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:31,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:57:31,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:57:31,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:57:31,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:57:31,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:57:31,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:57:31,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:57:31,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:57:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:57:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:57:31,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:57:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:57:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:57:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:57:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:57:31,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:57:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:57:31,992 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:57:32,998 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:57:32,999 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:57:33,780 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:57:33,781 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:57:33,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33 BoogieIcfgContainer [2019-11-26 02:57:33,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:57:33,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:57:33,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:57:33,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:57:33,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:57:30" (1/3) ... [2019-11-26 02:57:33,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404db7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:33, skipping insertion in model container [2019-11-26 02:57:33,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (2/3) ... [2019-11-26 02:57:33,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404db7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:33, skipping insertion in model container [2019-11-26 02:57:33,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33" (3/3) ... [2019-11-26 02:57:33,788 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-26 02:57:33,797 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:57:33,804 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:57:33,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:57:33,844 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:57:33,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:57:33,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:57:33,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:57:33,845 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:57:33,845 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:57:33,845 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:57:33,845 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:57:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 02:57:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:57:33,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:33,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:33,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2111145241, now seen corresponding path program 1 times [2019-11-26 02:57:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268339171] [2019-11-26 02:57:33,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:34,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268339171] [2019-11-26 02:57:34,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:34,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:34,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582029096] [2019-11-26 02:57:34,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:34,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:34,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:34,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:34,198 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-11-26 02:57:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:34,658 INFO L93 Difference]: Finished difference Result 239 states and 412 transitions. [2019-11-26 02:57:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:34,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:57:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:34,671 INFO L225 Difference]: With dead ends: 239 [2019-11-26 02:57:34,671 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:34,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2019-11-26 02:57:34,712 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 39 [2019-11-26 02:57:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:34,712 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2019-11-26 02:57:34,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2019-11-26 02:57:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:57:34,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:34,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:34,715 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2143539849, now seen corresponding path program 1 times [2019-11-26 02:57:34,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:34,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767922610] [2019-11-26 02:57:34,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:34,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767922610] [2019-11-26 02:57:34,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:34,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:34,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652484183] [2019-11-26 02:57:34,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:34,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:34,834 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand 4 states. [2019-11-26 02:57:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:35,214 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2019-11-26 02:57:35,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:35,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:57:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:35,217 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:35,217 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:35,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2019-11-26 02:57:35,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 49 [2019-11-26 02:57:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:35,228 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2019-11-26 02:57:35,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2019-11-26 02:57:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:57:35,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:35,231 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:35,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1219726776, now seen corresponding path program 1 times [2019-11-26 02:57:35,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:35,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198077351] [2019-11-26 02:57:35,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:35,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198077351] [2019-11-26 02:57:35,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:35,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:35,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603095542] [2019-11-26 02:57:35,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:35,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,331 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand 4 states. [2019-11-26 02:57:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:35,691 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2019-11-26 02:57:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:35,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:57:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:35,693 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:35,693 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:35,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2019-11-26 02:57:35,709 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 50 [2019-11-26 02:57:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:35,709 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2019-11-26 02:57:35,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2019-11-26 02:57:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:35,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:35,718 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:35,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1455684601, now seen corresponding path program 1 times [2019-11-26 02:57:35,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:35,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103334144] [2019-11-26 02:57:35,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:35,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103334144] [2019-11-26 02:57:35,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:35,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:35,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507142657] [2019-11-26 02:57:35,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:35,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,828 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 4 states. [2019-11-26 02:57:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:36,125 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2019-11-26 02:57:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:36,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:36,128 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:36,128 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:36,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-26 02:57:36,143 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 51 [2019-11-26 02:57:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:36,143 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-26 02:57:36,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-26 02:57:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:36,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:36,144 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:36,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1237655021, now seen corresponding path program 1 times [2019-11-26 02:57:36,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:36,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342386355] [2019-11-26 02:57:36,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:36,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342386355] [2019-11-26 02:57:36,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:36,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678060469] [2019-11-26 02:57:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:36,250 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 4 states. [2019-11-26 02:57:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:36,490 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:57:36,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:36,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:36,492 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:36,492 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:36,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2019-11-26 02:57:36,500 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 51 [2019-11-26 02:57:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2019-11-26 02:57:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2019-11-26 02:57:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:36,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:36,502 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:36,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 30630851, now seen corresponding path program 1 times [2019-11-26 02:57:36,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:36,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469420736] [2019-11-26 02:57:36,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:36,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469420736] [2019-11-26 02:57:36,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:36,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:36,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895782028] [2019-11-26 02:57:36,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:36,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:36,557 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand 4 states. [2019-11-26 02:57:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:36,830 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:57:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:36,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:36,835 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:36,835 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:36,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2019-11-26 02:57:36,842 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 51 [2019-11-26 02:57:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:36,843 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2019-11-26 02:57:36,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2019-11-26 02:57:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:57:36,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:36,844 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:36,844 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1167289475, now seen corresponding path program 1 times [2019-11-26 02:57:36,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:36,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907128757] [2019-11-26 02:57:36,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907128757] [2019-11-26 02:57:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:36,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394503497] [2019-11-26 02:57:36,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:36,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:36,905 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand 4 states. [2019-11-26 02:57:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:37,186 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2019-11-26 02:57:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:37,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:57:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:37,188 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:37,188 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:37,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-11-26 02:57:37,195 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 52 [2019-11-26 02:57:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:37,196 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-11-26 02:57:37,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-11-26 02:57:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:57:37,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:37,197 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:37,197 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash -216836158, now seen corresponding path program 1 times [2019-11-26 02:57:37,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:37,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249765321] [2019-11-26 02:57:37,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:37,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249765321] [2019-11-26 02:57:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:37,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597738368] [2019-11-26 02:57:37,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:37,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:37,281 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 4 states. [2019-11-26 02:57:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:37,506 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2019-11-26 02:57:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:37,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:57:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:37,508 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:57:37,508 INFO L226 Difference]: Without dead ends: 125 [2019-11-26 02:57:37,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-26 02:57:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-26 02:57:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-26 02:57:37,514 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 52 [2019-11-26 02:57:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:37,514 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-26 02:57:37,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-26 02:57:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:57:37,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:37,516 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:37,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -804794028, now seen corresponding path program 1 times [2019-11-26 02:57:37,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:37,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167696722] [2019-11-26 02:57:37,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:37,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167696722] [2019-11-26 02:57:37,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:37,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:37,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154795481] [2019-11-26 02:57:37,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:37,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:37,567 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 4 states. [2019-11-26 02:57:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:37,854 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-26 02:57:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:37,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-26 02:57:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:37,856 INFO L225 Difference]: With dead ends: 220 [2019-11-26 02:57:37,856 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:57:37,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:57:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-26 02:57:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-11-26 02:57:37,861 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 53 [2019-11-26 02:57:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:37,861 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-11-26 02:57:37,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-11-26 02:57:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:57:37,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:37,862 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:37,863 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash -691477064, now seen corresponding path program 1 times [2019-11-26 02:57:37,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436737248] [2019-11-26 02:57:37,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:37,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436737248] [2019-11-26 02:57:37,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:37,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:37,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632629456] [2019-11-26 02:57:37,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:37,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:37,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:37,924 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 4 states. [2019-11-26 02:57:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:38,314 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-11-26 02:57:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:38,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-26 02:57:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:38,317 INFO L225 Difference]: With dead ends: 252 [2019-11-26 02:57:38,317 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:57:38,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:57:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:57:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:57:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2019-11-26 02:57:38,322 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 54 [2019-11-26 02:57:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:38,322 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2019-11-26 02:57:38,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2019-11-26 02:57:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:57:38,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:38,323 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:38,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1738255386, now seen corresponding path program 1 times [2019-11-26 02:57:38,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:38,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021038974] [2019-11-26 02:57:38,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:38,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021038974] [2019-11-26 02:57:38,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:38,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:38,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224469412] [2019-11-26 02:57:38,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:38,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:38,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:38,376 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand 4 states. [2019-11-26 02:57:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:38,722 INFO L93 Difference]: Finished difference Result 272 states and 406 transitions. [2019-11-26 02:57:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:38,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:57:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:38,724 INFO L225 Difference]: With dead ends: 272 [2019-11-26 02:57:38,724 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:57:38,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:57:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:57:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:57:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2019-11-26 02:57:38,730 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 64 [2019-11-26 02:57:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:38,730 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2019-11-26 02:57:38,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-11-26 02:57:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:57:38,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:38,732 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:38,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -898643241, now seen corresponding path program 1 times [2019-11-26 02:57:38,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:38,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698234616] [2019-11-26 02:57:38,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:57:38,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698234616] [2019-11-26 02:57:38,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:38,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:57:38,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439536909] [2019-11-26 02:57:38,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:38,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:38,805 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand 5 states. [2019-11-26 02:57:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:39,241 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2019-11-26 02:57:39,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:57:39,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-26 02:57:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:39,243 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:57:39,243 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:57:39,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:57:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:57:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-11-26 02:57:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2019-11-26 02:57:39,250 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 65 [2019-11-26 02:57:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:39,250 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2019-11-26 02:57:39,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2019-11-26 02:57:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:39,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:39,251 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:39,251 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash 125999972, now seen corresponding path program 1 times [2019-11-26 02:57:39,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:39,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209412076] [2019-11-26 02:57:39,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:39,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209412076] [2019-11-26 02:57:39,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:39,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:39,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969162588] [2019-11-26 02:57:39,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:39,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:39,323 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand 4 states. [2019-11-26 02:57:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:39,666 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-11-26 02:57:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:39,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:39,668 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:39,669 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:39,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-26 02:57:39,679 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 66 [2019-11-26 02:57:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:39,679 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-26 02:57:39,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-26 02:57:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:39,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:39,681 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:39,681 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1394285844, now seen corresponding path program 1 times [2019-11-26 02:57:39,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:39,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516250037] [2019-11-26 02:57:39,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:39,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516250037] [2019-11-26 02:57:39,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:39,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:39,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590049389] [2019-11-26 02:57:39,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:39,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:39,743 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 4 states. [2019-11-26 02:57:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,078 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:57:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:40,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,081 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:40,081 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:40,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2019-11-26 02:57:40,112 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 66 [2019-11-26 02:57:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,112 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-11-26 02:57:40,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2019-11-26 02:57:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:40,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,113 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,114 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,114 INFO L82 PathProgramCache]: Analyzing trace with hash 686496761, now seen corresponding path program 1 times [2019-11-26 02:57:40,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:40,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100090439] [2019-11-26 02:57:40,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:40,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100090439] [2019-11-26 02:57:40,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:40,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:40,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002955183] [2019-11-26 02:57:40,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:40,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:40,173 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand 4 states. [2019-11-26 02:57:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,456 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:57:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:40,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,458 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:40,458 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:40,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2019-11-26 02:57:40,465 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 66 [2019-11-26 02:57:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,465 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2019-11-26 02:57:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2019-11-26 02:57:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:57:40,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,466 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,466 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -20152346, now seen corresponding path program 1 times [2019-11-26 02:57:40,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:40,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673450103] [2019-11-26 02:57:40,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673450103] [2019-11-26 02:57:40,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:40,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:40,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407946829] [2019-11-26 02:57:40,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:40,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:40,516 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand 4 states. [2019-11-26 02:57:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,818 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:57:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:40,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:57:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,820 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:40,820 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:40,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2019-11-26 02:57:40,827 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 67 [2019-11-26 02:57:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,827 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2019-11-26 02:57:40,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2019-11-26 02:57:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:57:40,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,828 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,828 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -893204335, now seen corresponding path program 1 times [2019-11-26 02:57:40,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:40,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950209600] [2019-11-26 02:57:40,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:40,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950209600] [2019-11-26 02:57:40,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:40,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:40,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740357134] [2019-11-26 02:57:40,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:40,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:40,878 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand 4 states. [2019-11-26 02:57:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:41,188 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2019-11-26 02:57:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:41,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:57:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:41,190 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:57:41,190 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:57:41,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:57:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:57:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2019-11-26 02:57:41,196 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 67 [2019-11-26 02:57:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:41,196 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2019-11-26 02:57:41,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2019-11-26 02:57:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:57:41,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:41,197 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:41,197 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 813324510, now seen corresponding path program 1 times [2019-11-26 02:57:41,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166390202] [2019-11-26 02:57:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166390202] [2019-11-26 02:57:41,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:41,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:41,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776898474] [2019-11-26 02:57:41,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:41,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:41,253 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand 4 states. [2019-11-26 02:57:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:41,519 INFO L93 Difference]: Finished difference Result 302 states and 431 transitions. [2019-11-26 02:57:41,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:41,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:57:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:41,522 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:57:41,522 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:57:41,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:57:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:57:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2019-11-26 02:57:41,527 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 68 [2019-11-26 02:57:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:41,528 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2019-11-26 02:57:41,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2019-11-26 02:57:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:57:41,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:41,529 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:41,529 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2146065963, now seen corresponding path program 1 times [2019-11-26 02:57:41,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:41,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942646215] [2019-11-26 02:57:41,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942646215] [2019-11-26 02:57:41,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:41,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:41,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527825957] [2019-11-26 02:57:41,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:41,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:41,582 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand 4 states. [2019-11-26 02:57:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:41,875 INFO L93 Difference]: Finished difference Result 294 states and 420 transitions. [2019-11-26 02:57:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:41,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:57:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:41,877 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:57:41,877 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 02:57:41,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 02:57:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-11-26 02:57:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2019-11-26 02:57:41,884 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 69 [2019-11-26 02:57:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:41,884 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2019-11-26 02:57:41,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2019-11-26 02:57:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:57:41,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:41,885 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:41,886 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1430646510, now seen corresponding path program 1 times [2019-11-26 02:57:41,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:41,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979004532] [2019-11-26 02:57:41,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979004532] [2019-11-26 02:57:41,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995101276] [2019-11-26 02:57:41,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/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-11-26 02:57:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:42,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:57:42,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:42,198 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:42,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:57:42,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:57:42,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 5 [2019-11-26 02:57:42,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476915009] [2019-11-26 02:57:42,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:42,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:42,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:42,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:57:42,251 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand 3 states. [2019-11-26 02:57:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:42,305 INFO L93 Difference]: Finished difference Result 288 states and 412 transitions. [2019-11-26 02:57:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:42,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-26 02:57:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:42,307 INFO L225 Difference]: With dead ends: 288 [2019-11-26 02:57:42,307 INFO L226 Difference]: Without dead ends: 286 [2019-11-26 02:57:42,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:57:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-26 02:57:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-11-26 02:57:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:57:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 408 transitions. [2019-11-26 02:57:42,325 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 408 transitions. Word has length 72 [2019-11-26 02:57:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:42,325 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 408 transitions. [2019-11-26 02:57:42,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2019-11-26 02:57:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:57:42,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:42,327 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:42,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:42,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1554603859, now seen corresponding path program 1 times [2019-11-26 02:57:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:42,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854898667] [2019-11-26 02:57:42,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:57:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:57:42,855 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:57:42,856 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:57:43,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:57:43 BoogieIcfgContainer [2019-11-26 02:57:43,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:57:43,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:57:43,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:57:43,006 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:57:43,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33" (3/4) ... [2019-11-26 02:57:43,010 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:57:43,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:57:43,012 INFO L168 Benchmark]: Toolchain (without parser) took 12231.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -237.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,012 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:43,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,015 INFO L168 Benchmark]: Boogie Preprocessor took 123.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,016 INFO L168 Benchmark]: RCFGBuilder took 2136.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,016 INFO L168 Benchmark]: TraceAbstraction took 9222.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 930.2 MB in the beginning and 1.2 GB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:43,017 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:43,020 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2136.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9222.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 930.2 MB in the beginning and 1.2 GB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.3 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: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND TRUE s->hit [L1353] s->state = 8656 [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={5:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={5:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2803 SDtfs, 561 SDslu, 4254 SDs, 0 SdLazy, 2487 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=20, 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, 20 MinimizatonAttempts, 211 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 172202 SizeOfPredicates, 1 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 301/373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:57:44,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:57:44,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:57:44,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:57:44,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:57:44,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:57:44,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:57:44,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:57:44,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:57:44,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:57:44,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:57:44,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:57:44,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:57:44,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:57:44,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:57:44,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:57:44,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:57:44,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:57:44,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:57:44,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:57:44,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:57:44,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:57:44,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:57:44,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:57:44,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:57:44,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:57:44,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:57:44,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:57:44,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:57:44,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:57:44,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:57:44,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:57:44,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:57:44,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:57:44,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:57:44,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:57:44,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:57:44,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:57:44,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:57:44,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:57:44,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:57:44,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:57:44,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:57:44,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:57:44,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:57:44,915 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:57:44,915 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:57:44,915 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:57:44,915 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:57:44,916 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:57:44,916 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:57:44,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:57:44,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:57:44,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:57:44,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:57:44,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:57:44,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:57:44,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:57:44,919 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:57:44,919 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:57:44,919 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:57:44,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:57:44,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:57:44,920 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:57:44,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:57:44,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:57:44,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:57:44,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:57:44,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:57:44,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:44,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:57:44,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:57:44,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:57:44,923 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:57:44,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:57:44,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:57:44,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:57:44,924 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_6aa65482-855a-4062-ac10-056623b68923/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-26 02:57:45,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:57:45,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:57:45,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:57:45,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:57:45,237 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:57:45,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-26 02:57:45,292 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/f733219bf/4fa2fb02fc4a4bacb6a529f55069a784/FLAGbb17a71cf [2019-11-26 02:57:45,823 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:57:45,824 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-26 02:57:45,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/f733219bf/4fa2fb02fc4a4bacb6a529f55069a784/FLAGbb17a71cf [2019-11-26 02:57:46,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6aa65482-855a-4062-ac10-056623b68923/bin/utaipan/data/f733219bf/4fa2fb02fc4a4bacb6a529f55069a784 [2019-11-26 02:57:46,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:57:46,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:57:46,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:46,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:57:46,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:57:46,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:46,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f36af02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46, skipping insertion in model container [2019-11-26 02:57:46,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:46,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:57:46,406 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:46,812 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:57:46,813 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:57:46,813 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:57:46,852 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:57:46,860 INFO L168 Benchmark]: Toolchain (without parser) took 545.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:46,861 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:46,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:46,864 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...