./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/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.23-1dbac8b [2018-11-10 12:55:04,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:55:04,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:55:04,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:55:04,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:55:04,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:55:04,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:55:04,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:55:04,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:55:04,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:55:04,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:55:04,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:55:04,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:55:04,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:55:04,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:55:04,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:55:04,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:55:04,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:55:04,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:55:04,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:55:04,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:55:04,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:55:04,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:55:04,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:55:04,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:55:04,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:55:04,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:55:04,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:55:04,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:55:04,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:55:04,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:55:04,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:55:04,761 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:55:04,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:55:04,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:55:04,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:55:04,762 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:55:04,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:55:04,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:55:04,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:55:04,772 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:55:04,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:55:04,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:55:04,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:55:04,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:55:04,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:55:04,774 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:55:04,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:55:04,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:55:04,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:55:04,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:55:04,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:55:04,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:55:04,776 INFO L133 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/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/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 [2018-11-10 12:55:04,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:55:04,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:55:04,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:55:04,809 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:55:04,810 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:55:04,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-10 12:55:04,847 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/data/612c93909/12307bda54a043d5b59e3750a2aa985a/FLAGe10986aa5 [2018-11-10 12:55:05,236 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:55:05,237 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-10 12:55:05,241 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/data/612c93909/12307bda54a043d5b59e3750a2aa985a/FLAGe10986aa5 [2018-11-10 12:55:05,249 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/data/612c93909/12307bda54a043d5b59e3750a2aa985a [2018-11-10 12:55:05,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:55:05,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:55:05,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:55:05,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:55:05,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:55:05,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4224e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05, skipping insertion in model container [2018-11-10 12:55:05,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:55:05,276 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:55:05,374 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:55:05,377 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:55:05,391 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:55:05,399 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:55:05,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05 WrapperNode [2018-11-10 12:55:05,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:55:05,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:55:05,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:55:05,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:55:05,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:55:05,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:55:05,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:55:05,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:55:05,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... [2018-11-10 12:55:05,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:55:05,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:55:05,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:55:05,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:55:05,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/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 [2018-11-10 12:55:05,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:55:05,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:55:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:55:05,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:55:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:55:05,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:55:05,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:55:05,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:55:05,667 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:55:05,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:05 BoogieIcfgContainer [2018-11-10 12:55:05,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:55:05,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:55:05,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:55:05,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:55:05,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:05" (1/3) ... [2018-11-10 12:55:05,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b39fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:05, skipping insertion in model container [2018-11-10 12:55:05,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05" (2/3) ... [2018-11-10 12:55:05,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b39fe59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:05, skipping insertion in model container [2018-11-10 12:55:05,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:05" (3/3) ... [2018-11-10 12:55:05,673 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-10 12:55:05,680 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:55:05,684 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:55:05,695 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:55:05,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:55:05,722 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:55:05,722 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:55:05,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:55:05,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:55:05,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:55:05,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:55:05,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:55:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-10 12:55:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:55:05,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:05,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:05,746 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:05,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash 398758246, now seen corresponding path program 1 times [2018-11-10 12:55:05,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:05,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:55:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:55:05,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:05,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:55:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:55:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:55:05,884 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-11-10 12:55:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:06,042 INFO L93 Difference]: Finished difference Result 116 states and 211 transitions. [2018-11-10 12:55:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:55:06,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-10 12:55:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:06,054 INFO L225 Difference]: With dead ends: 116 [2018-11-10 12:55:06,054 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 12:55:06,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:55:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 12:55:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2018-11-10 12:55:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 12:55:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-11-10 12:55:06,092 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-11-10 12:55:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:06,092 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-11-10 12:55:06,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:55:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-11-10 12:55:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:55:06,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:06,093 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:06,093 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:06,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1482520181, now seen corresponding path program 1 times [2018-11-10 12:55:06,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:06,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:06,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:55:06,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:06,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:55:06,170 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 12:55:06,172 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139] [2018-11-10 12:55:06,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:55:06,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:55:06,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:55:06,308 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-10 12:55:06,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:06,313 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:55:06,374 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 61.46% of their original sizes. [2018-11-10 12:55:06,374 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:55:06,515 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-10 12:55:06,516 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:55:06,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:06,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-10 12:55:06,517 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:06,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:55:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:55:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:55:06,518 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 13 states. [2018-11-10 12:55:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:07,207 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2018-11-10 12:55:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:55:07,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-11-10 12:55:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:07,210 INFO L225 Difference]: With dead ends: 91 [2018-11-10 12:55:07,210 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 12:55:07,211 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:55:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 12:55:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2018-11-10 12:55:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 12:55:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2018-11-10 12:55:07,230 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 21 [2018-11-10 12:55:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:07,230 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2018-11-10 12:55:07,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:55:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2018-11-10 12:55:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:55:07,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:07,231 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:07,232 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:07,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 693279400, now seen corresponding path program 1 times [2018-11-10 12:55:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:07,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 12:55:07,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:55:07,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:55:07,271 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:07,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:55:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:55:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:55:07,272 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand 3 states. [2018-11-10 12:55:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:07,313 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2018-11-10 12:55:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:55:07,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-10 12:55:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:07,315 INFO L225 Difference]: With dead ends: 107 [2018-11-10 12:55:07,315 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:55:07,316 INFO L605 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 [2018-11-10 12:55:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:55:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-10 12:55:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 12:55:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2018-11-10 12:55:07,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 51 [2018-11-10 12:55:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:07,332 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2018-11-10 12:55:07,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:55:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2018-11-10 12:55:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:55:07,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:07,333 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:07,334 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:07,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1023624178, now seen corresponding path program 1 times [2018-11-10 12:55:07,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:07,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 12:55:07,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:07,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:55:07,385 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 12:55:07,385 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153] [2018-11-10 12:55:07,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:55:07,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:55:07,412 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:55:07,412 INFO L272 AbstractInterpreter]: Visited 35 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-10 12:55:07,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:07,418 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:55:07,469 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 66.08% of their original sizes. [2018-11-10 12:55:07,469 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:55:07,596 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-11-10 12:55:07,596 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:55:07,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:07,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-11-10 12:55:07,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:07,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:55:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:55:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:55:07,597 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 15 states. [2018-11-10 12:55:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:08,307 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-11-10 12:55:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 12:55:08,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-11-10 12:55:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:08,308 INFO L225 Difference]: With dead ends: 82 [2018-11-10 12:55:08,308 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:55:08,309 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-10 12:55:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:55:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 12:55:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:55:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-11-10 12:55:08,321 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 52 [2018-11-10 12:55:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:08,322 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-11-10 12:55:08,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:55:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-11-10 12:55:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 12:55:08,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:08,324 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:08,324 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:08,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1445669058, now seen corresponding path program 1 times [2018-11-10 12:55:08,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:08,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:08,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-10 12:55:08,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:08,393 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:55:08,394 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-11-10 12:55:08,394 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165] [2018-11-10 12:55:08,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:55:08,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:55:08,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:55:08,424 INFO L272 AbstractInterpreter]: Visited 53 different actions 101 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-10 12:55:08,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:08,427 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:55:08,492 INFO L227 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 60.4% of their original sizes. [2018-11-10 12:55:08,492 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:55:08,830 INFO L415 sIntCurrentIteration]: We unified 87 AI predicates to 87 [2018-11-10 12:55:08,830 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:55:08,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:08,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [7] total 27 [2018-11-10 12:55:08,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:08,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 12:55:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 12:55:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:55:08,831 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 22 states. [2018-11-10 12:55:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:10,617 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2018-11-10 12:55:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 12:55:10,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-11-10 12:55:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:10,619 INFO L225 Difference]: With dead ends: 103 [2018-11-10 12:55:10,619 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 12:55:10,620 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 12:55:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 12:55:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-11-10 12:55:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 12:55:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-11-10 12:55:10,635 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 88 [2018-11-10 12:55:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:10,636 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-11-10 12:55:10,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 12:55:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-11-10 12:55:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 12:55:10,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:10,638 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:10,638 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:10,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1187961660, now seen corresponding path program 1 times [2018-11-10 12:55:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:10,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:10,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 40 proven. 52 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-11-10 12:55:10,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:10,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:55:10,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-11-10 12:55:10,722 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [111], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167], [168], [169], [170], [171], [172] [2018-11-10 12:55:10,724 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:55:10,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:55:10,831 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:55:10,831 INFO L272 AbstractInterpreter]: Visited 61 different actions 367 times. Merged at 11 different actions 66 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-10 12:55:10,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:10,834 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:55:10,936 INFO L227 lantSequenceWeakener]: Weakened 91 states. On average, predicates are now at 60.02% of their original sizes. [2018-11-10 12:55:10,937 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:55:11,383 INFO L415 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2018-11-10 12:55:11,383 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:55:11,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:11,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [7] total 30 [2018-11-10 12:55:11,383 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:11,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 12:55:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 12:55:11,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-11-10 12:55:11,384 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 25 states. [2018-11-10 12:55:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:14,269 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. [2018-11-10 12:55:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 12:55:14,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 123 [2018-11-10 12:55:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:14,270 INFO L225 Difference]: With dead ends: 123 [2018-11-10 12:55:14,270 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 12:55:14,271 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 12:55:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 12:55:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-11-10 12:55:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 12:55:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2018-11-10 12:55:14,288 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 123 [2018-11-10 12:55:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:14,289 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2018-11-10 12:55:14,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 12:55:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2018-11-10 12:55:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 12:55:14,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:55:14,292 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:55:14,292 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:55:14,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1694343236, now seen corresponding path program 1 times [2018-11-10 12:55:14,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:55:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:55:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:55:14,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:55:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:55:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 58 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-11-10 12:55:14,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:55:14,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:55:14,373 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-11-10 12:55:14,373 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [25], [31], [39], [42], [45], [51], [57], [60], [75], [82], [85], [91], [97], [100], [103], [109], [111], [122], [125], [127], [130], [132], [133], [134], [135], [137], [138], [139], [140], [141], [142], [143], [144], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167], [168], [169], [170], [171], [172] [2018-11-10 12:55:14,375 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:55:14,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:55:14,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:55:14,524 INFO L272 AbstractInterpreter]: Visited 62 different actions 507 times. Merged at 12 different actions 106 times. Widened at 1 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 15 variables. [2018-11-10 12:55:14,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:55:14,527 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:55:14,612 INFO L227 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 58.64% of their original sizes. [2018-11-10 12:55:14,612 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:55:15,063 INFO L415 sIntCurrentIteration]: We unified 137 AI predicates to 137 [2018-11-10 12:55:15,063 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:55:15,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:55:15,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 31 [2018-11-10 12:55:15,063 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:55:15,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 12:55:15,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 12:55:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-11-10 12:55:15,064 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 26 states. [2018-11-10 12:55:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:55:16,841 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-10 12:55:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 12:55:16,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 138 [2018-11-10 12:55:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:55:16,841 INFO L225 Difference]: With dead ends: 95 [2018-11-10 12:55:16,841 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:55:16,842 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 12:55:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:55:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:55:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:55:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:55:16,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-11-10 12:55:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:55:16,843 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:55:16,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 12:55:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:55:16,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:55:16,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:55:16,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,132 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 170 [2018-11-10 12:55:17,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,268 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2018-11-10 12:55:17,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,398 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 161 [2018-11-10 12:55:17,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:55:17,739 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 24 [2018-11-10 12:55:17,867 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 24 [2018-11-10 12:55:18,575 WARN L179 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 53 [2018-11-10 12:55:18,731 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-11-10 12:55:19,104 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 34 [2018-11-10 12:55:19,499 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 34 [2018-11-10 12:55:20,013 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:55:20,014 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-10 12:55:20,014 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-11-10 12:55:20,014 INFO L421 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-11-10 12:55:20,015 INFO L421 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse6 (* 2 main_~scheme~0))) (let ((.cse4 (<= 0 .cse6)) (.cse0 (<= (* 2 main_~urilen~0) 2000000)) (.cse1 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse2 (<= .cse6 2000000))) (or (let ((.cse3 (+ main_~c~0 2))) (and .cse0 .cse1 .cse2 (<= .cse3 main_~cp~0) (<= .cse3 main_~tokenlen~0) (<= (* 2 main_~tokenlen~0) 2000000) .cse4 (<= 2 (* 2 main_~c~0)))) (let ((.cse5 (+ main_~tokenlen~0 main_~c~0))) (and .cse4 (<= 4 (* 2 main_~cp~0)) (and .cse0 (<= .cse5 1000000) .cse1 (= main_~c~0 0) .cse2) (<= 2 .cse5)))))) [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L421 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse6 (* 2 main_~scheme~0))) (let ((.cse4 (<= 0 .cse6)) (.cse0 (<= (* 2 main_~urilen~0) 2000000)) (.cse1 (<= (+ main_~cp~0 2) main_~urilen~0)) (.cse2 (<= .cse6 2000000))) (or (let ((.cse3 (+ main_~c~0 2))) (and .cse0 .cse1 .cse2 (<= .cse3 main_~cp~0) (<= .cse3 main_~tokenlen~0) (<= (* 2 main_~tokenlen~0) 2000000) .cse4 (<= 2 (* 2 main_~c~0)))) (let ((.cse5 (+ main_~tokenlen~0 main_~c~0))) (and .cse4 (<= 4 (* 2 main_~cp~0)) (and .cse0 (<= .cse5 1000000) .cse1 (= main_~c~0 0) .cse2) (<= 2 .cse5)))))) [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-11-10 12:55:20,015 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse5 (* 2 main_~scheme~0)) (.cse3 (* 2 main_~tokenlen~0))) (let ((.cse0 (* 2 main_~cp~0)) (.cse1 (<= .cse3 2000000)) (.cse2 (<= 0 .cse5)) (.cse4 (<= .cse5 2000000))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) (<= .cse0 1999998) .cse1 .cse2 (<= 0 (+ .cse3 2000000)) (<= 3 (+ main_~urilen~0 main_~cp~0)) .cse4) (and (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 (<= 2 .cse3) .cse4)))) [2018-11-10 12:55:20,016 INFO L421 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-11-10 12:55:20,016 INFO L421 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-11-10 12:55:20,016 INFO L425 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (* 2 main_~scheme~0))) (and (<= main_~tokenlen~0 (+ main_~c~0 1000000)) (= main_~c~0 0) (<= 2 (* 2 main_~tokenlen~0)) (<= .cse0 2000000) (<= 0 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (+ main_~c~0 main_~cp~0)) (<= (+ main_~c~0 main_~urilen~0) 1000000))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (* 2 main_~scheme~0))) (and (<= main_~tokenlen~0 (+ main_~c~0 1000000)) (= main_~c~0 0) (<= 2 (* 2 main_~tokenlen~0)) (<= .cse0 2000000) (<= 0 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (+ main_~c~0 main_~cp~0)) (<= (+ main_~c~0 main_~urilen~0) 1000000))) [2018-11-10 12:55:20,017 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L33-2(lines 32 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 .cse1) (<= .cse1 2000000))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L33-3(lines 33 38) the Hoare annotation is: (let ((.cse5 (* 2 main_~scheme~0)) (.cse3 (* 2 main_~tokenlen~0))) (let ((.cse0 (* 2 main_~cp~0)) (.cse1 (<= .cse3 2000000)) (.cse2 (<= 0 .cse5)) (.cse4 (<= .cse5 2000000))) (or (and (= main_~urilen~0 (+ main_~cp~0 1)) (<= .cse0 1999998) .cse1 .cse2 (<= 0 (+ .cse3 2000000)) (<= 3 (+ main_~urilen~0 main_~cp~0)) .cse4) (and (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 (<= 2 .cse3) .cse4)))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-11-10 12:55:20,017 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-11-10 12:55:20,018 INFO L421 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-11-10 12:55:20,018 INFO L428 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2018-11-10 12:55:20,018 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 12:55:20,018 INFO L421 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (+ main_~c~0 1)) (.cse1 (* 2 main_~scheme~0))) (and (<= .cse0 main_~tokenlen~0) (<= .cse0 main_~cp~0) (<= (* 2 main_~urilen~0) 2000000) (<= (* 2 main_~tokenlen~0) 2000000) (<= .cse1 2000000) (<= 0 .cse1) (<= (+ main_~cp~0 2) main_~urilen~0) (<= 2 (* 2 main_~c~0)))) [2018-11-10 12:55:20,018 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2018-11-10 12:55:20,018 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-10 12:55:20,018 INFO L421 ceAbstractionStarter]: At program point L51-2(lines 50 63) the Hoare annotation is: (let ((.cse0 (* 2 main_~cp~0)) (.cse7 (* 2 main_~scheme~0)) (.cse5 (* 2 main_~tokenlen~0))) (let ((.cse2 (<= .cse5 2000000)) (.cse3 (<= 0 .cse7)) (.cse1 (and (<= 1 (+ main_~scheme~0 main_~urilen~0)) (<= main_~tokenlen~0 (+ main_~urilen~0 999999)) (<= (* 2 main_~urilen~0) 2000000) (<= 2 .cse0) (<= (+ main_~tokenlen~0 main_~urilen~0) 2000000) (<= main_~urilen~0 (+ main_~scheme~0 1000000)) (<= (+ main_~cp~0 1) main_~urilen~0))) (.cse6 (<= .cse7 2000000))) (or (and (<= 4 .cse0) (let ((.cse4 (= main_~c~0 0))) (or (and (<= (+ main_~cp~0 2) main_~urilen~0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= 2 (+ main_~tokenlen~0 main_~c~0))))) (<= 2 .cse5) .cse6 (<= (+ main_~c~0 4) main_~urilen~0)) (and (<= (+ main_~c~0 2) main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) .cse2 .cse3 (<= 2 (* 2 main_~c~0)) .cse1 .cse6)))) [2018-11-10 12:55:20,018 INFO L425 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-11-10 12:55:20,018 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-11-10 12:55:20,018 INFO L421 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~tokenlen~0)) (.cse1 (* 2 main_~scheme~0))) (and (<= (* 2 main_~urilen~0) 2000000) (<= .cse0 2000000) (<= 2 (* 2 main_~cp~0)) (<= 2 .cse0) (<= 0 .cse1) (<= .cse1 2000000) (<= (+ main_~cp~0 2) main_~urilen~0))) [2018-11-10 12:55:20,019 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 12:55:20,019 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 12:55:20,019 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 12:55:20,019 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 12:55:20,019 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 12:55:20,019 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 12:55:20,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:55:20 BoogieIcfgContainer [2018-11-10 12:55:20,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:55:20,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:55:20,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:55:20,031 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:55:20,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:55:05" (3/4) ... [2018-11-10 12:55:20,034 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:55:20,038 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:55:20,038 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:55:20,039 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 12:55:20,041 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 12:55:20,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:55:20,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:55:20,086 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd8ffd4e-0462-420e-bf56-a4c75089b5b1/bin-2019/utaipan/witness.graphml [2018-11-10 12:55:20,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:55:20,087 INFO L168 Benchmark]: Toolchain (without parser) took 14834.85 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 555.2 MB). Free memory was 955.8 MB in the beginning and 1.4 GB in the end (delta: -453.0 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:55:20,087 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:55:20,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.50 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:55:20,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:55:20,088 INFO L168 Benchmark]: Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:55:20,088 INFO L168 Benchmark]: RCFGBuilder took 241.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:55:20,089 INFO L168 Benchmark]: TraceAbstraction took 14361.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -289.8 MB). Peak memory consumption was 661.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:55:20,089 INFO L168 Benchmark]: Witness Printer took 55.72 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:55:20,090 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.50 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14361.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -289.8 MB). Peak memory consumption was 661.9 MB. Max. memory is 11.5 GB. * Witness Printer took 55.72 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((4 <= 2 * cp && (((((cp + 2 <= urilen && (((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && c == 0) || ((((((((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && c == 0) && 2 <= tokenlen + c))) && 2 <= 2 * tokenlen) && 2 * scheme <= 2000000) && c + 4 <= urilen) || ((((((c + 2 <= cp && c + 1 <= tokenlen) && 2 * tokenlen <= 2000000) && 0 <= 2 * scheme) && 2 <= 2 * c) && (((((1 <= scheme + urilen && tokenlen <= urilen + 999999) && 2 * urilen <= 2000000) && 2 <= 2 * cp) && tokenlen + urilen <= 2000000) && urilen <= scheme + 1000000) && cp + 1 <= urilen) && 2 * scheme <= 2000000) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((2 * urilen <= 2000000 && 2 * tokenlen <= 2000000) && 2 <= 2 * cp) && 2 <= 2 * tokenlen) && cp + 1 <= urilen) && 0 <= 2 * scheme) && 2 * scheme <= 2000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 1 error locations. SAFE Result, 14.3s OverallTime, 7 OverallIterations, 21 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 359 SDtfs, 608 SDslu, 1861 SDs, 0 SdLazy, 712 SolverSat, 1120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 490 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9109655133036433 AbsIntWeakeningRatio, 0.41007194244604317 AbsIntAvgWeakeningVarsNumRemoved, 8.997601918465227 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 96 PreInvPairs, 140 NumberOfFragments, 1086 HoareAnnotationTreeSize, 96 FomulaSimplifications, 15555 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 26 FomulaSimplificationsInter, 11778 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 62586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 1741/1909 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...