./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/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 3607a70e53f56c4b4860f9fca9676a925474c3df ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:27:18,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:27:18,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:27:18,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:27:18,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:27:18,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:27:18,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:27:18,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:27:18,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:27:18,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:27:18,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:27:18,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:27:18,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:27:18,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:27:18,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:27:18,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:27:18,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:27:18,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:27:18,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:27:18,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:27:18,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:27:18,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:27:18,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:27:18,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:27:18,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:27:18,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:27:18,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:27:18,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:27:18,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:27:18,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:27:18,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:27:18,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:27:18,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:27:18,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:27:18,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:27:18,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:27:18,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:27:18,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:27:18,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:27:18,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:27:18,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:27:18,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:27:18,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:27:18,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:27:18,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:27:18,547 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:27:18,547 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:27:18,548 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:27:18,548 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:27:18,548 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:27:18,548 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:27:18,548 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:27:18,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:27:18,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:27:18,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:27:18,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:27:18,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:27:18,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:27:18,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:27:18,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:27:18,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:27:18,552 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_f6c1c208-2383-4f7a-b8d0-6ce12487e494/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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-12-07 12:27:18,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:27:18,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:27:18,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:27:18,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:27:18,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:27:18,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-12-07 12:27:18,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/data/b8d86dafa/3ff7aca81d524bbf832c74c084943fb6/FLAG0738223c7 [2019-12-07 12:27:19,151 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:27:19,152 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-12-07 12:27:19,156 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/data/b8d86dafa/3ff7aca81d524bbf832c74c084943fb6/FLAG0738223c7 [2019-12-07 12:27:19,164 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/data/b8d86dafa/3ff7aca81d524bbf832c74c084943fb6 [2019-12-07 12:27:19,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:27:19,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:27:19,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:19,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:27:19,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:27:19,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f146fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19, skipping insertion in model container [2019-12-07 12:27:19,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:27:19,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:27:19,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:27:19,310 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:27:19,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:27:19,367 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:27:19,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19 WrapperNode [2019-12-07 12:27:19,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:19,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:27:19,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:27:19,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:27:19,373 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:27:19" (1/1) ... [2019-12-07 12:27:19,378 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:27:19" (1/1) ... [2019-12-07 12:27:19,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:27:19,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:27:19,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:27:19,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:27:19,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... [2019-12-07 12:27:19,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:27:19,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:27:19,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:27:19,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:27:19,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/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:27:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:27:19,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:27:19,691 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:27:19,691 INFO L287 CfgBuilder]: Removed 42 assume(true) statements. [2019-12-07 12:27:19,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:19 BoogieIcfgContainer [2019-12-07 12:27:19,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:27:19,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:27:19,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:27:19,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:27:19,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:27:19" (1/3) ... [2019-12-07 12:27:19,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172d6855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:19, skipping insertion in model container [2019-12-07 12:27:19,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:19" (2/3) ... [2019-12-07 12:27:19,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172d6855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:19, skipping insertion in model container [2019-12-07 12:27:19,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:19" (3/3) ... [2019-12-07 12:27:19,698 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-12-07 12:27:19,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:27:19,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-12-07 12:27:19,715 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-12-07 12:27:19,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:27:19,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:27:19,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:27:19,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:27:19,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:27:19,732 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:27:19,732 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:27:19,732 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:27:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-12-07 12:27:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:27:19,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:19,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:19,749 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-12-07 12:27:19,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:19,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333464973] [2019-12-07 12:27:19,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:19,860 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:27:19,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333464973] [2019-12-07 12:27:19,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:19,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443905336] [2019-12-07 12:27:19,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:19,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:19,875 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-12-07 12:27:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:19,958 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2019-12-07 12:27:19,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:19,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 12:27:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:19,966 INFO L225 Difference]: With dead ends: 168 [2019-12-07 12:27:19,966 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 12:27:19,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 12:27:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 12:27:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 12:27:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-12-07 12:27:19,998 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2019-12-07 12:27:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:19,999 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-12-07 12:27:19,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-12-07 12:27:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:27:19,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:19,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:20,000 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-12-07 12:27:20,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:20,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488979546] [2019-12-07 12:27:20,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:20,035 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:27:20,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488979546] [2019-12-07 12:27:20,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:20,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:27:20,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399930837] [2019-12-07 12:27:20,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:20,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:20,038 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2019-12-07 12:27:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:20,131 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-12-07 12:27:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:20,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 12:27:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:20,132 INFO L225 Difference]: With dead ends: 83 [2019-12-07 12:27:20,132 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 12:27:20,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 12:27:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 12:27:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 12:27:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-12-07 12:27:20,140 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2019-12-07 12:27:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:20,140 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-12-07 12:27:20,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-12-07 12:27:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:27:20,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:20,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:20,141 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2019-12-07 12:27:20,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:20,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215540881] [2019-12-07 12:27:20,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:20,169 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:27:20,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215540881] [2019-12-07 12:27:20,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:20,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:27:20,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662823112] [2019-12-07 12:27:20,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:20,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:20,170 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2019-12-07 12:27:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:20,242 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-12-07 12:27:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:20,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:27:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:20,244 INFO L225 Difference]: With dead ends: 88 [2019-12-07 12:27:20,244 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 12:27:20,244 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:27:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 12:27:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-12-07 12:27:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:27:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-12-07 12:27:20,251 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2019-12-07 12:27:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-12-07 12:27:20,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-12-07 12:27:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:27:20,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:20,252 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:20,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2019-12-07 12:27:20,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:20,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174681132] [2019-12-07 12:27:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:20,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174681132] [2019-12-07 12:27:20,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904607101] [2019-12-07 12:27:20,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/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:27:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:20,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:27:20,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:20,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:20,379 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:20,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619689742] [2019-12-07 12:27:20,423 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:27:20,423 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:27:20,428 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:27:20,434 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:27:20,435 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:27:20,637 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:27:21,405 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:27:21,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:27:21,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 8 [2019-12-07 12:27:21,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564297913] [2019-12-07 12:27:21,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:27:21,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:27:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:27:21,407 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 8 states. [2019-12-07 12:27:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,528 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-12-07 12:27:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:27:21,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 12:27:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,529 INFO L225 Difference]: With dead ends: 80 [2019-12-07 12:27:21,529 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 12:27:21,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:27:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 12:27:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-12-07 12:27:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:27:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 12:27:21,535 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 26 [2019-12-07 12:27:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,536 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 12:27:21,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:27:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 12:27:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:27:21,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:21,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -672139459, now seen corresponding path program 1 times [2019-12-07 12:27:21,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:21,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380148841] [2019-12-07 12:27:21,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,782 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:27:21,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380148841] [2019-12-07 12:27:21,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:21,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797409576] [2019-12-07 12:27:21,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:21,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:21,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:21,784 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2019-12-07 12:27:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,810 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-12-07 12:27:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:21,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 12:27:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,811 INFO L225 Difference]: With dead ends: 84 [2019-12-07 12:27:21,811 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:27:21,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:27:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 12:27:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:27:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-12-07 12:27:21,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2019-12-07 12:27:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,815 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-12-07 12:27:21,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-12-07 12:27:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:27:21,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,817 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 550411780, now seen corresponding path program 1 times [2019-12-07 12:27:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:21,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457140225] [2019-12-07 12:27:21,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,852 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:27:21,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457140225] [2019-12-07 12:27:21,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:27:21,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454647180] [2019-12-07 12:27:21,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:21,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:21,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:21,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:21,853 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2019-12-07 12:27:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,899 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-12-07 12:27:21,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:27:21,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 12:27:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,901 INFO L225 Difference]: With dead ends: 64 [2019-12-07 12:27:21,901 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 12:27:21,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 12:27:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-12-07 12:27:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:27:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-12-07 12:27:21,908 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 39 [2019-12-07 12:27:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,908 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-12-07 12:27:21,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-12-07 12:27:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:27:21,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 664905863, now seen corresponding path program 1 times [2019-12-07 12:27:21,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:21,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823140810] [2019-12-07 12:27:21,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,958 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:27:21,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823140810] [2019-12-07 12:27:21,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:27:21,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195237596] [2019-12-07 12:27:21,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:21,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:21,959 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 5 states. [2019-12-07 12:27:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:22,010 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-12-07 12:27:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:27:22,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 12:27:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:22,011 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:27:22,011 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 12:27:22,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 12:27:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 12:27:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:27:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-12-07 12:27:22,016 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 41 [2019-12-07 12:27:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:22,017 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-12-07 12:27:22,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-12-07 12:27:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:27:22,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:22,019 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:22,019 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash -743371514, now seen corresponding path program 1 times [2019-12-07 12:27:22,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:27:22,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975157395] [2019-12-07 12:27:22,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:22,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975157395] [2019-12-07 12:27:22,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458131651] [2019-12-07 12:27:22,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/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:27:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:22,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:27:22,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:22,115 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:22,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:27:22,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-12-07 12:27:22,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426461608] [2019-12-07 12:27:22,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:22,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:27:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:27:22,126 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2019-12-07 12:27:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:22,178 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-12-07 12:27:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:27:22,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 12:27:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:22,179 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:27:22,179 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:27:22,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:27:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:27:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:27:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:27:22,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2019-12-07 12:27:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:22,180 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:27:22,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:27:22,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:27:22,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:22,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:27:22,697 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,698 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,698 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L242 CegarLoopResult]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L242 CegarLoopResult]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,699 INFO L246 CegarLoopResult]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-12-07 12:27:22,700 INFO L242 CegarLoopResult]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,700 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,700 INFO L242 CegarLoopResult]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,700 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,700 INFO L242 CegarLoopResult]: At program point L4-23(line 41) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,700 INFO L246 CegarLoopResult]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,700 INFO L242 CegarLoopResult]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,700 INFO L246 CegarLoopResult]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,700 INFO L242 CegarLoopResult]: At program point L4-29(line 44) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L242 CegarLoopResult]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (= ULTIMATE.start_main_~c~0 0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,701 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L242 CegarLoopResult]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,702 INFO L246 CegarLoopResult]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L242 CegarLoopResult]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L242 CegarLoopResult]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,703 INFO L246 CegarLoopResult]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L242 CegarLoopResult]: At program point L55-1(lines 55 61) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,704 INFO L242 CegarLoopResult]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L5-16(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L4-48(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L5-17(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L242 CegarLoopResult]: At program point L4-50(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L4-51(lines 4 6) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,704 INFO L246 CegarLoopResult]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,705 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L242 CegarLoopResult]: At program point L33-1(lines 3 38) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L249 CegarLoopResult]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 12:27:22,706 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-12-07 12:27:22,707 INFO L246 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2019-12-07 12:27:22,707 INFO L242 CegarLoopResult]: At program point L51-1(lines 3 63) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-12-07 12:27:22,707 INFO L249 CegarLoopResult]: At program point L68(lines 10 69) the Hoare annotation is: true [2019-12-07 12:27:22,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:27:22 BoogieIcfgContainer [2019-12-07 12:27:22,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:27:22,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:27:22,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:27:22,730 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:27:22,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:19" (3/4) ... [2019-12-07 12:27:22,733 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:27:22,744 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2019-12-07 12:27:22,744 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:27:22,798 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f6c1c208-2383-4f7a-b8d0-6ce12487e494/bin/utaipan/witness.graphml [2019-12-07 12:27:22,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:27:22,799 INFO L168 Benchmark]: Toolchain (without parser) took 3631.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:27:22,800 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:27:22,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.78 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:27:22,800 INFO L168 Benchmark]: Boogie Preprocessor took 18.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,801 INFO L168 Benchmark]: RCFGBuilder took 278.29 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,801 INFO L168 Benchmark]: TraceAbstraction took 3036.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.0 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,801 INFO L168 Benchmark]: Witness Printer took 68.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,802 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.78 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 18.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 278.29 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3036.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -49.0 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.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 - 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 - 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 18 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((c == 0 && cp + 1 < urilen) && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 18 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 421 SDtfs, 290 SDslu, 371 SDs, 0 SdLazy, 391 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, 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, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 51 NumberOfFragments, 351 HoareAnnotationTreeSize, 20 FomulaSimplifications, 272 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 501 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 28618 SizeOfPredicates, 15 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 18/30 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...