./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c --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_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/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 253410f53553d69ef02e4dba1b07bb26de7bec75 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:23:40,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:23:40,849 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:23:40,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:23:40,856 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:23:40,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:23:40,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:23:40,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:23:40,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:23:40,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:23:40,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:23:40,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:23:40,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:23:40,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:23:40,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:23:40,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:23:40,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:23:40,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:23:40,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:23:40,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:23:40,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:23:40,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:23:40,869 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:23:40,870 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:23:40,870 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:23:40,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:23:40,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:23:40,872 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:23:40,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:23:40,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:23:40,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:23:40,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:23:40,874 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:23:40,874 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:23:40,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:23:40,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:23:40,875 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 02:23:40,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:23:40,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:23:40,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:23:40,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:23:40,884 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:23:40,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:23:40,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 02:23:40,884 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:23:40,884 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 02:23:40,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 02:23:40,885 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:23:40,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:23:40,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:23:40,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:23:40,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:23:40,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:23:40,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:23:40,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:23:40,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:23:40,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:23:40,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:23:40,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:23:40,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 02:23:40,888 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_fdd12c04-da58-4131-8950-252112c8b5fc/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 -> 253410f53553d69ef02e4dba1b07bb26de7bec75 [2018-11-10 02:23:40,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:23:40,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:23:40,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:23:40,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:23:40,926 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:23:40,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 02:23:40,972 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/data/0f103d194/febda30b163c46c3a04e91887d10d2f6/FLAG21deab4a1 [2018-11-10 02:23:41,304 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:23:41,305 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 02:23:41,311 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/data/0f103d194/febda30b163c46c3a04e91887d10d2f6/FLAG21deab4a1 [2018-11-10 02:23:41,320 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/data/0f103d194/febda30b163c46c3a04e91887d10d2f6 [2018-11-10 02:23:41,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:23:41,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:23:41,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:23:41,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:23:41,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:23:41,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e892343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41, skipping insertion in model container [2018-11-10 02:23:41,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:23:41,354 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:23:41,467 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:23:41,469 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:23:41,484 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:23:41,493 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:23:41,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41 WrapperNode [2018-11-10 02:23:41,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:23:41,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:23:41,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:23:41,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:23:41,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:23:41,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:23:41,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:23:41,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:23:41,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... [2018-11-10 02:23:41,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:23:41,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:23:41,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:23:41,521 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:23:41,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/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 02:23:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:23:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:23:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:23:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:23:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:23:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:23:41,789 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:23:41,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:41 BoogieIcfgContainer [2018-11-10 02:23:41,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:23:41,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:23:41,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:23:41,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:23:41,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:23:41" (1/3) ... [2018-11-10 02:23:41,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bbe6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:23:41, skipping insertion in model container [2018-11-10 02:23:41,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:23:41" (2/3) ... [2018-11-10 02:23:41,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bbe6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:23:41, skipping insertion in model container [2018-11-10 02:23:41,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:41" (3/3) ... [2018-11-10 02:23:41,795 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 02:23:41,803 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:23:41,809 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:23:41,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:23:41,843 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:23:41,843 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:23:41,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:23:41,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:23:41,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:23:41,844 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:23:41,844 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:23:41,844 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:23:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 02:23:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 02:23:41,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:41,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:41,861 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:41,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1255492894, now seen corresponding path program 1 times [2018-11-10 02:23:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:41,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:41,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:41,950 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 02:23:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:41,952 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:41,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:41,970 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-10 02:23:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,045 INFO L93 Difference]: Finished difference Result 139 states and 227 transitions. [2018-11-10 02:23:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-10 02:23:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,053 INFO L225 Difference]: With dead ends: 139 [2018-11-10 02:23:42,053 INFO L226 Difference]: Without dead ends: 85 [2018-11-10 02:23:42,055 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 02:23:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-10 02:23:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-10 02:23:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 02:23:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2018-11-10 02:23:42,082 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 9 [2018-11-10 02:23:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,083 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2018-11-10 02:23:42,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2018-11-10 02:23:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 02:23:42,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,084 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:42,084 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1634016107, now seen corresponding path program 1 times [2018-11-10 02:23:42,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:23:42,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,123 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand 3 states. [2018-11-10 02:23:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,183 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2018-11-10 02:23:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 02:23:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,185 INFO L225 Difference]: With dead ends: 165 [2018-11-10 02:23:42,185 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 02:23:42,186 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 02:23:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 02:23:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-10 02:23:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-10 02:23:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2018-11-10 02:23:42,204 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 15 [2018-11-10 02:23:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,204 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2018-11-10 02:23:42,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2018-11-10 02:23:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 02:23:42,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,205 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:42,206 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1077847367, now seen corresponding path program 1 times [2018-11-10 02:23:42,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:23:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,239 INFO L87 Difference]: Start difference. First operand 124 states and 187 transitions. Second operand 3 states. [2018-11-10 02:23:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,306 INFO L93 Difference]: Finished difference Result 243 states and 375 transitions. [2018-11-10 02:23:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 02:23:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,307 INFO L225 Difference]: With dead ends: 243 [2018-11-10 02:23:42,307 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 02:23:42,308 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 02:23:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 02:23:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-11-10 02:23:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 02:23:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2018-11-10 02:23:42,320 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 22 [2018-11-10 02:23:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,320 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2018-11-10 02:23:42,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2018-11-10 02:23:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 02:23:42,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,321 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-11-10 02:23:42,322 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1094390367, now seen corresponding path program 1 times [2018-11-10 02:23:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 02:23:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,356 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand 3 states. [2018-11-10 02:23:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,435 INFO L93 Difference]: Finished difference Result 383 states and 595 transitions. [2018-11-10 02:23:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 02:23:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,437 INFO L225 Difference]: With dead ends: 383 [2018-11-10 02:23:42,437 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 02:23:42,438 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 02:23:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 02:23:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2018-11-10 02:23:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-10 02:23:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 303 transitions. [2018-11-10 02:23:42,453 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 303 transitions. Word has length 38 [2018-11-10 02:23:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,453 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 303 transitions. [2018-11-10 02:23:42,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 303 transitions. [2018-11-10 02:23:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 02:23:42,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,455 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:42,455 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1893868002, now seen corresponding path program 1 times [2018-11-10 02:23:42,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 02:23:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,498 INFO L87 Difference]: Start difference. First operand 219 states and 303 transitions. Second operand 3 states. [2018-11-10 02:23:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,533 INFO L93 Difference]: Finished difference Result 435 states and 608 transitions. [2018-11-10 02:23:42,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 02:23:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,534 INFO L225 Difference]: With dead ends: 435 [2018-11-10 02:23:42,534 INFO L226 Difference]: Without dead ends: 274 [2018-11-10 02:23:42,535 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 02:23:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-10 02:23:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-11-10 02:23:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-10 02:23:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 379 transitions. [2018-11-10 02:23:42,544 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 379 transitions. Word has length 52 [2018-11-10 02:23:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,545 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 379 transitions. [2018-11-10 02:23:42,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2018-11-10 02:23:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 02:23:42,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,546 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:42,547 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash -174827734, now seen corresponding path program 1 times [2018-11-10 02:23:42,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 02:23:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,571 INFO L87 Difference]: Start difference. First operand 272 states and 379 transitions. Second operand 3 states. [2018-11-10 02:23:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,647 INFO L93 Difference]: Finished difference Result 550 states and 779 transitions. [2018-11-10 02:23:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-10 02:23:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,649 INFO L225 Difference]: With dead ends: 550 [2018-11-10 02:23:42,649 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 02:23:42,650 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 02:23:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 02:23:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-11-10 02:23:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-10 02:23:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 257 transitions. [2018-11-10 02:23:42,658 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 257 transitions. Word has length 56 [2018-11-10 02:23:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,658 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 257 transitions. [2018-11-10 02:23:42,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2018-11-10 02:23:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 02:23:42,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:42,660 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 02:23:42,661 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:42,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 15777295, now seen corresponding path program 1 times [2018-11-10 02:23:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:23:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:42,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:23:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 02:23:42,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:42,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:23:42,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:23:42,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:23:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:23:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:23:42,715 INFO L87 Difference]: Start difference. First operand 198 states and 257 transitions. Second operand 3 states. [2018-11-10 02:23:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:42,732 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2018-11-10 02:23:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:23:42,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-10 02:23:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:42,733 INFO L225 Difference]: With dead ends: 326 [2018-11-10 02:23:42,733 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 02:23:42,734 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 02:23:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 02:23:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 02:23:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 02:23:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 02:23:42,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-11-10 02:23:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:42,735 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:23:42,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:23:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:23:42,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 02:23:42,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 02:23:42,894 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 02:23:42,894 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:23:42,894 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:23:42,894 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 02:23:42,894 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 02:23:42,894 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:23:42,894 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-11-10 02:23:42,894 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L421 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (<= main_~blastFlag~0 3))) (or (and (<= 8640 main_~s__state~0) .cse0 (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2) (and .cse0 (<= 8672 main_~s__state~0)))) [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-11-10 02:23:42,895 INFO L421 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-10 02:23:42,896 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-11-10 02:23:42,896 INFO L421 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,896 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-11-10 02:23:42,896 INFO L421 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,896 INFO L421 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,896 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-11-10 02:23:42,896 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-11-10 02:23:42,896 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-11-10 02:23:42,896 INFO L421 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-11-10 02:23:42,897 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-11-10 02:23:42,897 INFO L421 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,897 INFO L421 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-11-10 02:23:42,897 INFO L421 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 212) no Hoare annotation was computed. [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-11-10 02:23:42,897 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-11-10 02:23:42,898 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-11-10 02:23:42,898 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L428 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L421 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= main_~blastFlag~0 3) (<= 8672 main_~s__state~0)) [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-11-10 02:23:42,899 INFO L421 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-10 02:23:42,899 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-11-10 02:23:42,900 INFO L421 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,900 INFO L421 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,900 INFO L421 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-11-10 02:23:42,900 INFO L421 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,900 INFO L421 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-10 02:23:42,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:23:42 BoogieIcfgContainer [2018-11-10 02:23:42,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:23:42,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:23:42,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:23:42,914 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:23:42,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:23:41" (3/4) ... [2018-11-10 02:23:42,917 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 02:23:42,921 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 02:23:42,922 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 02:23:42,926 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 02:23:42,926 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 02:23:42,926 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 02:23:42,971 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fdd12c04-da58-4131-8950-252112c8b5fc/bin-2019/utaipan/witness.graphml [2018-11-10 02:23:42,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:23:42,972 INFO L168 Benchmark]: Toolchain (without parser) took 1648.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 959.2 MB in the beginning and 936.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 158.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,973 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:23:42,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.17 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,974 INFO L168 Benchmark]: Boogie Preprocessor took 14.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:23:42,974 INFO L168 Benchmark]: RCFGBuilder took 268.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,974 INFO L168 Benchmark]: TraceAbstraction took 1122.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,975 INFO L168 Benchmark]: Witness Printer took 57.58 ms. Allocated memory is still 1.2 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:23:42,976 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.17 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 268.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1122.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.58 ms. Allocated memory is still 1.2 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: 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: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2) || (blastFlag <= 3 && 8672 <= s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: blastFlag <= 3 && 8672 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 467 SDtfs, 250 SDslu, 328 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 86 NumberOfFragments, 106 HoareAnnotationTreeSize, 21 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 29816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 243/243 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...