./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:57:54,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:57:54,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:57:54,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:57:54,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:57:54,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:57:54,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:57:54,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:57:54,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:57:54,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:57:54,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:57:54,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:57:54,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:57:54,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:57:54,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:57:54,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:57:54,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:57:54,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:57:54,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:57:54,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:57:54,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:57:54,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:57:54,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:57:54,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:57:54,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:57:54,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:57:54,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:57:54,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:57:54,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:57:54,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:57:54,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:57:54,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:57:54,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:57:54,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:57:54,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:57:54,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:57:54,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:57:54,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:57:54,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:57:54,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:57:54,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:57:54,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:57:54,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:57:54,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:57:54,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:57:54,549 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:57:54,549 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:57:54,549 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:57:54,549 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:57:54,549 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:57:54,550 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:57:54,550 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:57:54,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:57:54,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:57:54,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:57:54,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:57:54,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:57:54,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:57:54,553 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_5fad3672-a6df-442f-a6e4-323e1b144a21/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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-12-07 12:57:54,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:57:54,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:57:54,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:57:54,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:57:54,663 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:57:54,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-12-07 12:57:54,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/data/2cc811c92/e5e20cf9385a4e02bf49e7f8a865f75b/FLAG427bb590f [2019-12-07 12:57:55,106 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:57:55,107 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-12-07 12:57:55,110 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/data/2cc811c92/e5e20cf9385a4e02bf49e7f8a865f75b/FLAG427bb590f [2019-12-07 12:57:55,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/data/2cc811c92/e5e20cf9385a4e02bf49e7f8a865f75b [2019-12-07 12:57:55,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:57:55,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:57:55,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:57:55,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:57:55,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:57:55,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e573a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55, skipping insertion in model container [2019-12-07 12:57:55,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:57:55,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:57:55,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:57:55,260 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:57:55,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:57:55,318 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:57:55,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55 WrapperNode [2019-12-07 12:57:55,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:57:55,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:57:55,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:57:55,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:57:55,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:57:55,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:57:55,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:57:55,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:57:55,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... [2019-12-07 12:57:55,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:57:55,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:57:55,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:57:55,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:57:55,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:57:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:57:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:57:55,562 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:57:55,563 INFO L287 CfgBuilder]: Removed 21 assume(true) statements. [2019-12-07 12:57:55,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:55 BoogieIcfgContainer [2019-12-07 12:57:55,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:57:55,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:57:55,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:57:55,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:57:55,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:57:55" (1/3) ... [2019-12-07 12:57:55,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491940ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:57:55, skipping insertion in model container [2019-12-07 12:57:55,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:55" (2/3) ... [2019-12-07 12:57:55,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491940ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:57:55, skipping insertion in model container [2019-12-07 12:57:55,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:55" (3/3) ... [2019-12-07 12:57:55,568 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-12-07 12:57:55,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:57:55,578 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-12-07 12:57:55,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 12:57:55,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:57:55,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:57:55,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:57:55,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:57:55,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:57:55,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:57:55,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:57:55,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:57:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-12-07 12:57:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:57:55,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:55,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:55,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash -396103483, now seen corresponding path program 1 times [2019-12-07 12:57:55,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:55,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053610784] [2019-12-07 12:57:55,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:55,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053610784] [2019-12-07 12:57:55,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:55,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33010496] [2019-12-07 12:57:55,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 12:57:55,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 12:57:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 12:57:55,721 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-12-07 12:57:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:55,735 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2019-12-07 12:57:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 12:57:55,736 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 12:57:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:55,742 INFO L225 Difference]: With dead ends: 78 [2019-12-07 12:57:55,742 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 12:57:55,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 12:57:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 12:57:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 12:57:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:57:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 12:57:55,772 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 8 [2019-12-07 12:57:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:55,772 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 12:57:55,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 12:57:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 12:57:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:57:55,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:55,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:55,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 551382066, now seen corresponding path program 1 times [2019-12-07 12:57:55,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446891351] [2019-12-07 12:57:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:55,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446891351] [2019-12-07 12:57:55,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:55,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:57:55,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513554499] [2019-12-07 12:57:55,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:57:55,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:57:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:57:55,815 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2019-12-07 12:57:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:55,867 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-12-07 12:57:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:57:55,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 12:57:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:55,868 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:57:55,868 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 12:57:55,869 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-12-07 12:57:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 12:57:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-12-07 12:57:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 12:57:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 12:57:55,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2019-12-07 12:57:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:55,874 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 12:57:55,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:57:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 12:57:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:57:55,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:55,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:55,875 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1597345877, now seen corresponding path program 1 times [2019-12-07 12:57:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337737957] [2019-12-07 12:57:55,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:55,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337737957] [2019-12-07 12:57:55,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:55,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:57:55,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823834068] [2019-12-07 12:57:55,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:57:55,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:57:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:57:55,906 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 5 states. [2019-12-07 12:57:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:55,975 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 12:57:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:55,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:57:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:55,976 INFO L225 Difference]: With dead ends: 48 [2019-12-07 12:57:55,976 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 12:57:55,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 12:57:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 12:57:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:57:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 12:57:55,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 11 [2019-12-07 12:57:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:55,983 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 12:57:55,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:57:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 12:57:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:57:55,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:55,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:55,983 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1050645099, now seen corresponding path program 1 times [2019-12-07 12:57:55,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:55,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036941097] [2019-12-07 12:57:55,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036941097] [2019-12-07 12:57:56,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:56,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:57:56,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759635720] [2019-12-07 12:57:56,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:57:56,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:57:56,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:57:56,011 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-12-07 12:57:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:56,043 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-12-07 12:57:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:57:56,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:57:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:56,044 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:57:56,044 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 12:57:56,044 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-12-07 12:57:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 12:57:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 12:57:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:57:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 12:57:56,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2019-12-07 12:57:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:56,049 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 12:57:56,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:57:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 12:57:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:57:56,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:56,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:56,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1213350277, now seen corresponding path program 1 times [2019-12-07 12:57:56,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:56,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592334890] [2019-12-07 12:57:56,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592334890] [2019-12-07 12:57:56,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:56,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:57:56,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6441162] [2019-12-07 12:57:56,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:56,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:56,094 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-12-07 12:57:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:56,187 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 12:57:56,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:57:56,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 12:57:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:56,188 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:57:56,188 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:57:56,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:57:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:57:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-12-07 12:57:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:57:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 12:57:56,193 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 15 [2019-12-07 12:57:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:56,194 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 12:57:56,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 12:57:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:57:56,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:56,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:56,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -352468520, now seen corresponding path program 1 times [2019-12-07 12:57:56,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:56,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425465235] [2019-12-07 12:57:56,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425465235] [2019-12-07 12:57:56,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:56,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:57:56,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441512192] [2019-12-07 12:57:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:56,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:56,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:56,230 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-12-07 12:57:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:56,310 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-12-07 12:57:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:57:56,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 12:57:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:56,311 INFO L225 Difference]: With dead ends: 59 [2019-12-07 12:57:56,311 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 12:57:56,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:57:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 12:57:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-12-07 12:57:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 12:57:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-12-07 12:57:56,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2019-12-07 12:57:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:56,316 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-12-07 12:57:56,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-12-07 12:57:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:57:56,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:56,317 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] [2019-12-07 12:57:56,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 988547556, now seen corresponding path program 1 times [2019-12-07 12:57:56,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:56,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607693340] [2019-12-07 12:57:56,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607693340] [2019-12-07 12:57:56,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370367668] [2019-12-07 12:57:56,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:56,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 12:57:56,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:56,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:57:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,521 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:56,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:57:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:56,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1346560330] [2019-12-07 12:57:56,590 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:57:56,591 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:57:56,595 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:57:56,599 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:57:56,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:57:56,782 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:57:57,534 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-07 12:57:58,036 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:58,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:57:58,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2019-12-07 12:57:58,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605767469] [2019-12-07 12:57:58,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 12:57:58,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 12:57:58,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 12:57:58,038 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 16 states. [2019-12-07 12:57:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:58,598 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-12-07 12:57:58,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 12:57:58,599 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-07 12:57:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:58,600 INFO L225 Difference]: With dead ends: 115 [2019-12-07 12:57:58,600 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 12:57:58,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=615, Invalid=3167, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 12:57:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 12:57:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2019-12-07 12:57:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 12:57:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-12-07 12:57:58,608 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25 [2019-12-07 12:57:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:58,608 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-12-07 12:57:58,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 12:57:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-12-07 12:57:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:57:58,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:58,609 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:58,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:58,810 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1849429313, now seen corresponding path program 1 times [2019-12-07 12:57:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:58,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328064178] [2019-12-07 12:57:58,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:58,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328064178] [2019-12-07 12:57:58,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687923801] [2019-12-07 12:57:58,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:58,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:57:58,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:58,918 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:58,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523339136] [2019-12-07 12:57:58,940 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 12:57:58,941 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:57:58,941 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:57:58,941 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:57:58,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:57:59,018 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:57:59,474 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:59,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:57:59,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-12-07 12:57:59,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078240863] [2019-12-07 12:57:59,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:57:59,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:57:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:57:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:57:59,476 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 11 states. [2019-12-07 12:57:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:59,601 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 12:57:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:57:59,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-07 12:57:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:59,602 INFO L225 Difference]: With dead ends: 72 [2019-12-07 12:57:59,602 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 12:57:59,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 12:57:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 12:57:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 12:57:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 12:57:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-12-07 12:57:59,609 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 25 [2019-12-07 12:57:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:59,610 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-12-07 12:57:59,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:57:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-12-07 12:57:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:57:59,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:59,611 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:59,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:59,812 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1910118038, now seen corresponding path program 2 times [2019-12-07 12:57:59,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:57:59,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597445205] [2019-12-07 12:57:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:59,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597445205] [2019-12-07 12:57:59,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685800685] [2019-12-07 12:57:59,915 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:59,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:57:59,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:57:59,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 12:57:59,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:00,037 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:00,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92263775] [2019-12-07 12:58:00,145 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 12:58:00,145 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:58:00,146 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:58:00,146 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:58:00,146 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:58:00,227 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:58:00,950 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:58:00,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:58:00,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2019-12-07 12:58:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148847934] [2019-12-07 12:58:00,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:58:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:58:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:58:00,952 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 23 states. [2019-12-07 12:58:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:01,723 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-12-07 12:58:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 12:58:01,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2019-12-07 12:58:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:01,724 INFO L225 Difference]: With dead ends: 77 [2019-12-07 12:58:01,724 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:58:01,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 12:58:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:58:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-12-07 12:58:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 12:58:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-12-07 12:58:01,732 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 35 [2019-12-07 12:58:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:01,732 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-12-07 12:58:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:58:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-12-07 12:58:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:58:01,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:01,733 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:01,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:01,934 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -843226378, now seen corresponding path program 2 times [2019-12-07 12:58:01,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:58:01,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077837698] [2019-12-07 12:58:01,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 12:58:02,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077837698] [2019-12-07 12:58:02,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818022055] [2019-12-07 12:58:02,033 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:02,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 12:58:02,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:58:02,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 12:58:02,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:58:02,170 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:58:02,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2112251368] [2019-12-07 12:58:02,259 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:58:02,260 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:58:02,260 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:58:02,260 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:58:02,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:58:02,337 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:58:03,589 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-07 12:58:03,843 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-12-07 12:58:04,132 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:58:04,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:58:04,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2019-12-07 12:58:04,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491225748] [2019-12-07 12:58:04,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 12:58:04,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:58:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 12:58:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 12:58:04,134 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2019-12-07 12:58:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:04,287 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-12-07 12:58:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:58:04,288 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-12-07 12:58:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:04,288 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:58:04,288 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:58:04,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=312, Invalid=1850, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 12:58:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:58:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:58:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:58:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:58:04,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-12-07 12:58:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:04,289 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:58:04,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 12:58:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:58:04,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:58:04,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:04,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:58:04,686 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,686 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,686 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:58:04,686 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,686 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~buflim~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) [2019-12-07 12:58:04,686 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~buflim~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L242 CegarLoopResult]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0) (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L242 CegarLoopResult]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~in~0)) (.cse1 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse2 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2))) [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L242 CegarLoopResult]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,687 INFO L242 CegarLoopResult]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-12-07 12:58:04,687 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L242 CegarLoopResult]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L249 CegarLoopResult]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,688 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L249 CegarLoopResult]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-12-07 12:58:04,689 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-12-07 12:58:04,690 INFO L246 CegarLoopResult]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-12-07 12:58:04,690 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:58:04,690 INFO L246 CegarLoopResult]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-12-07 12:58:04,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:58:04 BoogieIcfgContainer [2019-12-07 12:58:04,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:58:04,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:58:04,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:58:04,707 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:58:04,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:55" (3/4) ... [2019-12-07 12:58:04,710 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:58:04,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-12-07 12:58:04,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 12:58:04,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:58:04,763 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5fad3672-a6df-442f-a6e4-323e1b144a21/bin/utaipan/witness.graphml [2019-12-07 12:58:04,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:58:04,764 INFO L168 Benchmark]: Toolchain (without parser) took 9642.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 943.5 MB in the beginning and 850.1 MB in the end (delta: 93.5 MB). Peak memory consumption was 271.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,764 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:04,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:04,765 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,765 INFO L168 Benchmark]: RCFGBuilder took 206.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,766 INFO L168 Benchmark]: TraceAbstraction took 9142.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 852.4 MB in the end (delta: 225.0 MB). Peak memory consumption was 297.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,766 INFO L168 Benchmark]: Witness Printer took 56.55 ms. Allocated memory is still 1.2 GB. Free memory was 852.4 MB in the beginning and 850.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:04,768 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9142.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 852.4 MB in the end (delta: 225.0 MB). Peak memory consumption was 297.9 MB. Max. memory is 11.5 GB. * Witness Printer took 56.55 ms. Allocated memory is still 1.2 GB. Free memory was 852.4 MB in the beginning and 850.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((buf + 1 <= buflim && 1 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((buf + 1 <= buflim && 1 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((in <= 0 && 0 == buf) && bufferlen < inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) || (((((1 == cond && buflim + in + 3 <= buf + inlen) && 0 <= buf) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 8 error locations. Result: SAFE, OverallTime: 8.8s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 271 SDtfs, 869 SDslu, 654 SDs, 0 SdLazy, 797 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 272 SyntacticMatches, 30 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 44 NumberOfFragments, 184 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4497 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 541 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 331 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 95873 SizeOfPredicates, 37 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 39/234 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...