./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/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 5f5357e64289d6bac41f74df7b40a85eebbaa806 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:42:59,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:42:59,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:42:59,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:42:59,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:42:59,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:42:59,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:42:59,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:42:59,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:42:59,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:42:59,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:42:59,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:42:59,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:42:59,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:42:59,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:42:59,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:42:59,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:42:59,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:42:59,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:42:59,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:42:59,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:42:59,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:42:59,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:42:59,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:42:59,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:42:59,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:42:59,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:42:59,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:42:59,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:42:59,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:42:59,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:42:59,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:42:59,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:42:59,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:42:59,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:42:59,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:42:59,327 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:42:59,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:42:59,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:42:59,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:42:59,338 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:42:59,339 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:42:59,339 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:42:59,339 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:42:59,339 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:42:59,339 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:42:59,339 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:42:59,340 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:42:59,340 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:42:59,340 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:42:59,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:42:59,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:42:59,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:42:59,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:42:59,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:42:59,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:42:59,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:42:59,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:42:59,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:42:59,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:42:59,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:42:59,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:42:59,344 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_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2018-12-02 20:42:59,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:42:59,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:42:59,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:42:59,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:42:59,377 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:42:59,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-02 20:42:59,413 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/data/7be81788b/352d8c8737d5447cb31e780a9d9b781d/FLAGfe1b5b98a [2018-12-02 20:42:59,829 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:42:59,829 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-02 20:42:59,833 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/data/7be81788b/352d8c8737d5447cb31e780a9d9b781d/FLAGfe1b5b98a [2018-12-02 20:42:59,841 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/data/7be81788b/352d8c8737d5447cb31e780a9d9b781d [2018-12-02 20:42:59,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:42:59,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:42:59,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:42:59,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:42:59,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:42:59,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:42:59,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6952e9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59, skipping insertion in model container [2018-12-02 20:42:59,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:42:59,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:42:59,864 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:42:59,962 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:42:59,968 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:42:59,984 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:42:59,995 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:42:59,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59 WrapperNode [2018-12-02 20:42:59,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:42:59,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:42:59,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:42:59,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:43:00,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:43:00,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:43:00,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:43:00,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:43:00,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... [2018-12-02 20:43:00,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:43:00,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:43:00,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:43:00,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:43:00,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/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-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-12-02 20:43:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:43:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-12-02 20:43:00,100 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:43:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:43:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:43:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-12-02 20:43:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:43:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:43:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 20:43:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 20:43:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:43:00,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:43:00,266 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 20:43:00,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:43:00 BoogieIcfgContainer [2018-12-02 20:43:00,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:43:00,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:43:00,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:43:00,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:43:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:42:59" (1/3) ... [2018-12-02 20:43:00,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f67979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:43:00, skipping insertion in model container [2018-12-02 20:43:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:42:59" (2/3) ... [2018-12-02 20:43:00,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f67979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:43:00, skipping insertion in model container [2018-12-02 20:43:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:43:00" (3/3) ... [2018-12-02 20:43:00,270 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-12-02 20:43:00,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:43:00,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:43:00,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:43:00,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:43:00,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:43:00,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:43:00,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:43:00,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:43:00,306 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:43:00,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:43:00,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:43:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-02 20:43:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 20:43:00,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1431465242, now seen corresponding path program 1 times [2018-12-02 20:43:00,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:43:00,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 20:43:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 20:43:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 20:43:00,427 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-12-02 20:43:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:00,440 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2018-12-02 20:43:00,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 20:43:00,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-12-02 20:43:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:00,446 INFO L225 Difference]: With dead ends: 93 [2018-12-02 20:43:00,446 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:43:00,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 20:43:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:43:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 20:43:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:43:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-12-02 20:43:00,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-12-02 20:43:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:00,470 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-02 20:43:00,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 20:43:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-12-02 20:43:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 20:43:00,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1642980317, now seen corresponding path program 1 times [2018-12-02 20:43:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:00,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:43:00,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:43:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:43:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:43:00,523 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2018-12-02 20:43:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:00,536 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-12-02 20:43:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:43:00,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 20:43:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:00,537 INFO L225 Difference]: With dead ends: 78 [2018-12-02 20:43:00,537 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 20:43:00,537 INFO L631 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-12-02 20:43:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 20:43:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 20:43:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 20:43:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-02 20:43:00,541 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2018-12-02 20:43:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:00,541 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-02 20:43:00,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:43:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-02 20:43:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 20:43:00,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2065682143, now seen corresponding path program 1 times [2018-12-02 20:43:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:43:00,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:43:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:43:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:43:00,591 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 5 states. [2018-12-02 20:43:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:00,649 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2018-12-02 20:43:00,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:43:00,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-02 20:43:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:00,651 INFO L225 Difference]: With dead ends: 106 [2018-12-02 20:43:00,651 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 20:43:00,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:43:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 20:43:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-12-02 20:43:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 20:43:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-12-02 20:43:00,661 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2018-12-02 20:43:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:00,661 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-12-02 20:43:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:43:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-12-02 20:43:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 20:43:00,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,663 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1270055137, now seen corresponding path program 1 times [2018-12-02 20:43:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:00,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:43:00,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:43:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:43:00,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:43:00,734 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 6 states. [2018-12-02 20:43:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:00,816 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2018-12-02 20:43:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:43:00,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-02 20:43:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:00,817 INFO L225 Difference]: With dead ends: 158 [2018-12-02 20:43:00,817 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 20:43:00,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:43:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 20:43:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2018-12-02 20:43:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 20:43:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-12-02 20:43:00,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 33 [2018-12-02 20:43:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:00,821 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-12-02 20:43:00,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:43:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2018-12-02 20:43:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 20:43:00,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,822 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1030767453, now seen corresponding path program 1 times [2018-12-02 20:43:00,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:00,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:43:00,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:43:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:43:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:43:00,860 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 5 states. [2018-12-02 20:43:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:00,914 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2018-12-02 20:43:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:43:00,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-02 20:43:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:00,915 INFO L225 Difference]: With dead ends: 136 [2018-12-02 20:43:00,915 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 20:43:00,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:43:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 20:43:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2018-12-02 20:43:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 20:43:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-12-02 20:43:00,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 33 [2018-12-02 20:43:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:00,921 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-12-02 20:43:00,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:43:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-12-02 20:43:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 20:43:00,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:00,922 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:00,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:00,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 292691762, now seen corresponding path program 1 times [2018-12-02 20:43:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:00,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 20:43:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:00,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:43:00,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:00,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:43:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:43:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:43:00,979 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 7 states. [2018-12-02 20:43:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:01,101 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2018-12-02 20:43:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:43:01,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-02 20:43:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:01,103 INFO L225 Difference]: With dead ends: 162 [2018-12-02 20:43:01,103 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 20:43:01,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:43:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 20:43:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-12-02 20:43:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 20:43:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2018-12-02 20:43:01,110 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 38 [2018-12-02 20:43:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:01,110 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2018-12-02 20:43:01,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:43:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-12-02 20:43:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 20:43:01,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:01,111 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:01,111 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:01,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1701452944, now seen corresponding path program 1 times [2018-12-02 20:43:01,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:01,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 20:43:01,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:01,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:43:01,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:01,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:43:01,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:43:01,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:43:01,169 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 7 states. [2018-12-02 20:43:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:01,268 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2018-12-02 20:43:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:43:01,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-02 20:43:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:01,269 INFO L225 Difference]: With dead ends: 113 [2018-12-02 20:43:01,269 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 20:43:01,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:43:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 20:43:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-12-02 20:43:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 20:43:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2018-12-02 20:43:01,276 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 38 [2018-12-02 20:43:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:01,277 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2018-12-02 20:43:01,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:43:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-12-02 20:43:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 20:43:01,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:01,279 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:01,279 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:01,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:01,279 INFO L82 PathProgramCache]: Analyzing trace with hash -442357683, now seen corresponding path program 1 times [2018-12-02 20:43:01,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 20:43:01,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:43:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:43:01,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:43:01,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:43:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:43:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:43:01,311 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 4 states. [2018-12-02 20:43:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:01,331 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2018-12-02 20:43:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:43:01,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-02 20:43:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:01,333 INFO L225 Difference]: With dead ends: 162 [2018-12-02 20:43:01,333 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 20:43:01,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:43:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 20:43:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-02 20:43:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 20:43:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2018-12-02 20:43:01,339 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 40 [2018-12-02 20:43:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:01,339 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2018-12-02 20:43:01,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:43:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2018-12-02 20:43:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 20:43:01,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:01,340 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:01,341 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:01,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1463426037, now seen corresponding path program 1 times [2018-12-02 20:43:01,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:01,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:01,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:43:01,394 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-02 20:43:01,395 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [16], [21], [25], [31], [34], [38], [43], [46], [51], [53], [59], [65], [68], [74], [80], [82], [89], [91], [93], [98], [104], [105], [106], [107], [111], [115], [118], [120], [126], [127], [128], [130], [131], [132], [134] [2018-12-02 20:43:01,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:43:01,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:43:01,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:43:01,619 INFO L272 AbstractInterpreter]: Visited 39 different actions 67 times. Merged at 13 different actions 26 times. Never widened. Performed 534 root evaluator evaluations with a maximum evaluation depth of 5. Performed 534 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-12-02 20:43:01,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:01,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:43:01,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:01,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:43:01,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:01,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:43:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:01,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:43:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:01,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:43:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:43:01,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2018-12-02 20:43:01,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:43:01,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:43:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:43:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:43:01,765 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand 8 states. [2018-12-02 20:43:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:01,832 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2018-12-02 20:43:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:43:01,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-02 20:43:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:01,833 INFO L225 Difference]: With dead ends: 227 [2018-12-02 20:43:01,833 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 20:43:01,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:43:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 20:43:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-12-02 20:43:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 20:43:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-12-02 20:43:01,838 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 40 [2018-12-02 20:43:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:01,838 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-12-02 20:43:01,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:43:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-12-02 20:43:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 20:43:01,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:01,839 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:01,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:01,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1715300200, now seen corresponding path program 2 times [2018-12-02 20:43:01,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:01,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:01,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:01,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:43:01,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 20:43:01,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 20:43:01,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:01,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:43:01,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 20:43:01,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 20:43:01,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 20:43:01,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:43:01,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:43:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:01,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:43:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:02,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:43:02,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2018-12-02 20:43:02,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:43:02,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 20:43:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 20:43:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:43:02,053 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 16 states. [2018-12-02 20:43:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:02,229 INFO L93 Difference]: Finished difference Result 241 states and 301 transitions. [2018-12-02 20:43:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:43:02,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-12-02 20:43:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:02,230 INFO L225 Difference]: With dead ends: 241 [2018-12-02 20:43:02,230 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 20:43:02,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-12-02 20:43:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 20:43:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2018-12-02 20:43:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 20:43:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2018-12-02 20:43:02,235 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2018-12-02 20:43:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:02,236 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2018-12-02 20:43:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 20:43:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2018-12-02 20:43:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 20:43:02,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:02,236 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:02,237 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1014235622, now seen corresponding path program 1 times [2018-12-02 20:43:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:02,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:43:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:02,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:02,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:02,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:43:02,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 20:43:02,284 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [16], [21], [25], [31], [34], [38], [43], [46], [51], [53], [59], [65], [68], [76], [80], [82], [89], [91], [93], [98], [104], [105], [106], [107], [111], [115], [118], [120], [126], [127], [128], [130], [131], [132], [134] [2018-12-02 20:43:02,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:43:02,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:43:02,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:43:02,347 INFO L272 AbstractInterpreter]: Visited 39 different actions 67 times. Merged at 13 different actions 26 times. Never widened. Performed 533 root evaluator evaluations with a maximum evaluation depth of 5. Performed 533 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-02 20:43:02,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:02,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:43:02,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:02,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:43:02,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:02,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:43:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:02,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:43:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:02,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:43:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:02,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:43:02,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2018-12-02 20:43:02,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:43:02,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 20:43:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 20:43:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-12-02 20:43:02,517 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 16 states. [2018-12-02 20:43:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:02,744 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2018-12-02 20:43:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:43:02,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-12-02 20:43:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:02,745 INFO L225 Difference]: With dead ends: 195 [2018-12-02 20:43:02,745 INFO L226 Difference]: Without dead ends: 193 [2018-12-02 20:43:02,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-12-02 20:43:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-02 20:43:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 133. [2018-12-02 20:43:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 20:43:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2018-12-02 20:43:02,751 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2018-12-02 20:43:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:02,752 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2018-12-02 20:43:02,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 20:43:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2018-12-02 20:43:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 20:43:02,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:02,752 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:02,753 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1762018646, now seen corresponding path program 1 times [2018-12-02 20:43:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:02,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:02,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:02,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:02,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:43:02,818 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 20:43:02,819 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [16], [21], [25], [31], [36], [38], [43], [46], [51], [53], [59], [65], [68], [74], [80], [82], [89], [91], [93], [98], [104], [105], [106], [107], [111], [115], [118], [120], [126], [127], [128], [130], [131], [132], [134] [2018-12-02 20:43:02,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:43:02,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:43:02,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:43:02,891 INFO L272 AbstractInterpreter]: Visited 39 different actions 67 times. Merged at 13 different actions 26 times. Never widened. Performed 528 root evaluator evaluations with a maximum evaluation depth of 5. Performed 528 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-02 20:43:02,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:02,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:43:02,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:43:02,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:43:02,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:02,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:43:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:43:02,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:43:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:03,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:43:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:43:03,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:43:03,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2018-12-02 20:43:03,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:43:03,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 20:43:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 20:43:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-12-02 20:43:03,097 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 16 states. [2018-12-02 20:43:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:43:03,318 INFO L93 Difference]: Finished difference Result 217 states and 268 transitions. [2018-12-02 20:43:03,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 20:43:03,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-12-02 20:43:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:43:03,319 INFO L225 Difference]: With dead ends: 217 [2018-12-02 20:43:03,319 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 20:43:03,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-12-02 20:43:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 20:43:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2018-12-02 20:43:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 20:43:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2018-12-02 20:43:03,324 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 45 [2018-12-02 20:43:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:43:03,324 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2018-12-02 20:43:03,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 20:43:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2018-12-02 20:43:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 20:43:03,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:43:03,325 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:43:03,325 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:43:03,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:43:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1831884072, now seen corresponding path program 1 times [2018-12-02 20:43:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:43:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:03,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:43:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:43:03,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:43:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:43:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:43:03,350 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:43:03,366 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,367 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,367 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,368 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,369 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,369 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,369 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,370 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:43:03 BoogieIcfgContainer [2018-12-02 20:43:03,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:43:03,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:43:03,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:43:03,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:43:03,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:43:00" (3/4) ... [2018-12-02 20:43:03,378 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:43:03,381 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,382 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,383 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,383 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,383 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,383 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,384 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,384 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,384 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-12-02 20:43:03,409 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f7bca68a-0ec4-43d9-b6cd-86d5878dce15/bin-2019/utaipan/witness.graphml [2018-12-02 20:43:03,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:43:03,410 INFO L168 Benchmark]: Toolchain (without parser) took 3566.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 166.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:43:03,411 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:43:03,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:43:03,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:43:03,412 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:43:03,412 INFO L168 Benchmark]: RCFGBuilder took 200.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:43:03,412 INFO L168 Benchmark]: TraceAbstraction took 3108.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 942.7 MB in the end (delta: 131.4 MB). Peak memory consumption was 182.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:43:03,413 INFO L168 Benchmark]: Witness Printer took 33.77 ms. Allocated memory is still 1.2 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:43:03,414 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3108.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 942.7 MB in the end (delta: 131.4 MB). Peak memory consumption was 182.7 MB. Max. memory is 11.5 GB. * Witness Printer took 33.77 ms. Allocated memory is still 1.2 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 VAL [A={40:0}] [L76] CALL parse_expression_list (A) VAL [str={40:0}] [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}] [L52] i++ [L53] str[i] [L54] case 0: VAL [i=0, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=1] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[start]=1, str[start]=1] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[start]=1] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 VAL [i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1, str[j]=1] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1, str[j]=1] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0, str[j]=1] [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={38:0}, src={40:0}] [L30] return strncpy(dest,src,n); [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={35:37}, start=0, str={40:0}, str={40:0}, str2={38:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. UNSAFE Result, 3.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 620 SDtfs, 924 SDslu, 2231 SDs, 0 SdLazy, 1520 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 324 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 319 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 107497 SizeOfPredicates, 11 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 6/93 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...