./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/invert_string_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_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 561472dda653ab23fa8eff641224e01683fc61ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:27:48,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:27:48,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:27:48,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:27:48,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:27:48,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:27:48,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:27:48,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:27:48,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:27:48,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:27:48,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:27:48,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:27:48,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:27:48,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:27:48,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:27:48,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:27:48,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:27:48,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:27:48,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:27:48,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:27:48,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:27:48,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:27:48,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:27:48,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:27:48,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:27:48,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:27:48,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:27:48,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:27:48,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:27:48,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:27:48,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:27:48,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:27:48,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:27:48,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:27:48,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:27:48,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:27:48,097 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:27:48,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:27:48,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:27:48,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:27:48,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:27:48,109 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:27:48,110 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:27:48,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:27:48,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:27:48,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:27:48,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:27:48,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:27:48,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:27:48,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:27:48,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:27:48,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:27:48,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:27:48,113 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_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 -> 561472dda653ab23fa8eff641224e01683fc61ba [2018-12-02 09:27:48,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:27:48,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:27:48,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:27:48,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:27:48,149 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:27:48,150 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-12-02 09:27:48,189 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/data/86d6f4d97/0b77050e279447d0a7ff633ac3811071/FLAG116b6bc67 [2018-12-02 09:27:48,523 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:27:48,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-12-02 09:27:48,527 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/data/86d6f4d97/0b77050e279447d0a7ff633ac3811071/FLAG116b6bc67 [2018-12-02 09:27:48,917 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/data/86d6f4d97/0b77050e279447d0a7ff633ac3811071 [2018-12-02 09:27:48,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:27:48,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:27:48,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:27:48,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:27:48,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:27:48,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:27:48" (1/1) ... [2018-12-02 09:27:48,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9438d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:48, skipping insertion in model container [2018-12-02 09:27:48,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:27:48" (1/1) ... [2018-12-02 09:27:48,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:27:48,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:27:49,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:27:49,033 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:27:49,046 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:27:49,059 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:27:49,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49 WrapperNode [2018-12-02 09:27:49,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:27:49,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:27:49,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:27:49,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:27:49,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:27:49,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:27:49,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:27:49,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:27:49,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... [2018-12-02 09:27:49,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:27:49,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:27:49,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:27:49,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:27:49,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 09:27:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:27:49,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:27:49,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:27:49,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 09:27:49,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 09:27:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:27:49,292 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:27:49,292 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 09:27:49,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:27:49 BoogieIcfgContainer [2018-12-02 09:27:49,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:27:49,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:27:49,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:27:49,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:27:49,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:27:48" (1/3) ... [2018-12-02 09:27:49,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69692e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:27:49, skipping insertion in model container [2018-12-02 09:27:49,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:49" (2/3) ... [2018-12-02 09:27:49,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69692e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:27:49, skipping insertion in model container [2018-12-02 09:27:49,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:27:49" (3/3) ... [2018-12-02 09:27:49,298 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-12-02 09:27:49,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:27:49,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:27:49,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:27:49,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:27:49,342 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:27:49,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:27:49,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:27:49,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:27:49,343 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:27:49,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:27:49,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:27:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 09:27:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 09:27:49,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:49,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:49,358 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:49,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-12-02 09:27:49,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:49,454 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 09:27:49,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:27:49,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:27:49,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:27:49,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 09:27:49,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:27:49,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:27:49,468 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-02 09:27:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:49,482 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-12-02 09:27:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:27:49,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-12-02 09:27:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:49,487 INFO L225 Difference]: With dead ends: 46 [2018-12-02 09:27:49,488 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 09:27:49,490 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 09:27:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 09:27:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 09:27:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 09:27:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-02 09:27:49,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-12-02 09:27:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:49,512 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 09:27:49,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 09:27:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-02 09:27:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 09:27:49,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:49,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:49,513 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:49,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-12-02 09:27:49,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:49,560 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 09:27:49,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:27:49,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:27:49,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:27:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:27:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:27:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:27:49,562 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-12-02 09:27:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:49,601 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-02 09:27:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:27:49,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-02 09:27:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:49,602 INFO L225 Difference]: With dead ends: 34 [2018-12-02 09:27:49,602 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 09:27:49,602 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 09:27:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 09:27:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 09:27:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 09:27:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-02 09:27:49,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-12-02 09:27:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:49,606 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-02 09:27:49,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:27:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-02 09:27:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 09:27:49,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:49,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:49,606 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:49,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-12-02 09:27:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:49,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:27:49,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:27:49,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:27:49,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:27:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:27:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:27:49,636 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-12-02 09:27:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:49,652 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-02 09:27:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:27:49,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 09:27:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:49,653 INFO L225 Difference]: With dead ends: 40 [2018-12-02 09:27:49,653 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 09:27:49,653 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 09:27:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 09:27:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-02 09:27:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 09:27:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-02 09:27:49,656 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-12-02 09:27:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:49,656 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-02 09:27:49,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:27:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-02 09:27:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 09:27:49,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:49,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:49,657 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:49,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-12-02 09:27:49,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:49,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:49,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:49,876 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 09:27:49,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:49,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:49,877 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 09:27:49,878 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [25], [27], [29], [33], [41], [51], [54], [56], [62], [63], [64], [66] [2018-12-02 09:27:49,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:27:49,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:27:50,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:27:50,028 INFO L272 AbstractInterpreter]: Visited 19 different actions 42 times. Merged at 6 different actions 17 times. Widened at 2 different actions 2 times. Performed 260 root evaluator evaluations with a maximum evaluation depth of 6. Performed 260 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 26 variables. [2018-12-02 09:27:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:50,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:27:50,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:50,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 09:27:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:50,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:27:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:50,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:50,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:27:50,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-02 09:27:50,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-02 09:27:50,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:27:50,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 09:27:50,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 09:27:50,234 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:50,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:27:50,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:27:50,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-12-02 09:27:50,279 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 09:27:50,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:50,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 09:27:50,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 09:27:50,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-02 09:27:50,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:50,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:50,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-12-02 09:27:50,453 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 09:27:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2018-12-02 09:27:50,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:50,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 09:27:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 09:27:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-12-02 09:27:50,468 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 19 states. [2018-12-02 09:27:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:50,787 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 09:27:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 09:27:50,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-02 09:27:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:50,789 INFO L225 Difference]: With dead ends: 46 [2018-12-02 09:27:50,789 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 09:27:50,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 09:27:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 09:27:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-12-02 09:27:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 09:27:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 09:27:50,799 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-12-02 09:27:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:50,799 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 09:27:50,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 09:27:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-02 09:27:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:27:50,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:50,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:50,800 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:50,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:50,801 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2018-12-02 09:27:50,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:50,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:50,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:27:50,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:50,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:50,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:27:50,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:27:50,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:50,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 09:27:50,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:27:50,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:27:50,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 09:27:50,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:27:50,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:50,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:27:50,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 09:27:50,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-02 09:27:50,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:27:50,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-02 09:27:50,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 09:27:50,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 09:27:50,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,983 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:50,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 09:27:50,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:50,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-12-02 09:27:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:51,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:51,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 09:27:51,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 09:27:51,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-02 09:27:51,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:51,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:51,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2018-12-02 09:27:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:51,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:51,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 23 [2018-12-02 09:27:51,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 09:27:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 09:27:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-12-02 09:27:51,164 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 15 states. [2018-12-02 09:27:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:51,581 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-12-02 09:27:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 09:27:51,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-02 09:27:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:51,582 INFO L225 Difference]: With dead ends: 71 [2018-12-02 09:27:51,582 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 09:27:51,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 09:27:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 09:27:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-12-02 09:27:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 09:27:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 09:27:51,589 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 21 [2018-12-02 09:27:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:51,589 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 09:27:51,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 09:27:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-02 09:27:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 09:27:51,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:51,590 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:51,590 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:51,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:51,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 3 times [2018-12-02 09:27:51,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:51,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:51,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:27:51,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:51,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:51,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:51,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:51,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:27:51,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:27:51,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:51,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 09:27:51,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 09:27:51,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 09:27:51,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 09:27:51,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:27:51,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:51,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-12-02 09:27:51,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-02 09:27:51,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-02 09:27:51,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2018-12-02 09:27:51,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:51,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-12-02 09:27:51,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:51,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-02 09:27:52,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 09:27:52,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:52,007 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:52,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-02 09:27:52,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 09:27:52,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:52,030 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:52,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-12-02 09:27:52,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:47, output treesize:3 [2018-12-02 09:27:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:52,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:52,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 09:27:52,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-12-02 09:27:52,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-02 09:27:52,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-12-02 09:27:52,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-12-02 09:27:52,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:52,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:52,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:27:52,296 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2018-12-02 09:27:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:52,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2018-12-02 09:27:52,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:52,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 09:27:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 09:27:52,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-12-02 09:27:52,339 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 22 states. [2018-12-02 09:27:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:52,757 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-12-02 09:27:52,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 09:27:52,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-12-02 09:27:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:52,759 INFO L225 Difference]: With dead ends: 69 [2018-12-02 09:27:52,759 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 09:27:52,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1235, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 09:27:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 09:27:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-12-02 09:27:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 09:27:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 09:27:52,764 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-12-02 09:27:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:52,764 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 09:27:52,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 09:27:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 09:27:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 09:27:52,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:52,764 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:52,765 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:52,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 832058620, now seen corresponding path program 4 times [2018-12-02 09:27:52,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:52,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:52,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:27:52,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:52,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:27:52,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:52,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:52,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:27:52,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:27:52,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:52,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/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 09:27:52,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:52,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:27:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:52,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:27:52,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:27:52,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:52,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-12-02 09:27:52,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:52,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:27:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:27:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:27:52,855 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2018-12-02 09:27:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:52,923 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-12-02 09:27:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 09:27:52,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-02 09:27:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:52,924 INFO L225 Difference]: With dead ends: 96 [2018-12-02 09:27:52,924 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 09:27:52,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:27:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 09:27:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2018-12-02 09:27:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 09:27:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-02 09:27:52,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-12-02 09:27:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:52,930 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 09:27:52,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:27:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-02 09:27:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 09:27:52,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:52,930 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:52,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:52,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 5 times [2018-12-02 09:27:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:52,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:52,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:27:53,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:53,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:53,240 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:27:53,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:27:53,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:53,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:27:53,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:27:53,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:27:53,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 09:27:53,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:27:53,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:53,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:27:53,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 09:27:53,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-12-02 09:27:53,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-02 09:27:53,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:29 [2018-12-02 09:27:53,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-02 09:27:53,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:53,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 09:27:53,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:27:53,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,457 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-12-02 09:27:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 09:27:53,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:53,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 09:27:53,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 09:27:53,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 09:27:53,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:53,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:53,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:53,602 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:28 [2018-12-02 09:27:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 09:27:53,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:53,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 38 [2018-12-02 09:27:53,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:53,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 09:27:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 09:27:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 09:27:53,707 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 29 states. [2018-12-02 09:27:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:54,988 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-12-02 09:27:54,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 09:27:54,989 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2018-12-02 09:27:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:54,991 INFO L225 Difference]: With dead ends: 103 [2018-12-02 09:27:54,991 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 09:27:54,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=675, Invalid=3357, Unknown=0, NotChecked=0, Total=4032 [2018-12-02 09:27:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 09:27:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 55. [2018-12-02 09:27:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 09:27:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-12-02 09:27:55,011 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 27 [2018-12-02 09:27:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:55,012 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-02 09:27:55,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 09:27:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-12-02 09:27:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:27:55,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:55,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:55,013 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:55,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash -836061513, now seen corresponding path program 1 times [2018-12-02 09:27:55,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:55,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:55,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:27:55,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:55,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:27:55,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:55,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:55,046 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-02 09:27:55,047 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [25], [27], [29], [33], [41], [43], [45], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67] [2018-12-02 09:27:55,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:27:55,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:27:55,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:27:55,119 INFO L272 AbstractInterpreter]: Visited 24 different actions 63 times. Merged at 10 different actions 22 times. Widened at 1 different actions 1 times. Performed 324 root evaluator evaluations with a maximum evaluation depth of 6. Performed 324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 5 different actions. Largest state had 28 variables. [2018-12-02 09:27:55,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:55,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:27:55,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:55,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:27:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:55,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:27:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:55,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:27:55,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:27:55,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:55,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-12-02 09:27:55,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:55,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:27:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:27:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:27:55,187 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 7 states. [2018-12-02 09:27:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:55,237 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-02 09:27:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:27:55,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 09:27:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:55,239 INFO L225 Difference]: With dead ends: 86 [2018-12-02 09:27:55,239 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 09:27:55,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:27:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 09:27:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-12-02 09:27:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 09:27:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-12-02 09:27:55,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 29 [2018-12-02 09:27:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:55,249 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-12-02 09:27:55,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:27:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-12-02 09:27:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:27:55,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:55,250 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:55,250 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:55,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2018-12-02 09:27:55,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:55,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:55,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:55,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:55,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:27:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:27:55,292 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:27:55,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:27:55 BoogieIcfgContainer [2018-12-02 09:27:55,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:27:55,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:27:55,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:27:55,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:27:55,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:27:49" (3/4) ... [2018-12-02 09:27:55,321 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 09:27:55,359 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_101c0ccf-6074-436c-9d82-df40c0c1ab53/bin-2019/utaipan/witness.graphml [2018-12-02 09:27:55,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:27:55,360 INFO L168 Benchmark]: Toolchain (without parser) took 6439.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 957.8 MB in the beginning and 1.0 GB in the end (delta: -88.5 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:27:55,361 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:27:55,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.74 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:27:55,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.01 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:27:55,362 INFO L168 Benchmark]: Boogie Preprocessor took 51.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 09:27:55,362 INFO L168 Benchmark]: RCFGBuilder took 163.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:27:55,363 INFO L168 Benchmark]: TraceAbstraction took 6026.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:27:55,363 INFO L168 Benchmark]: Witness Printer took 39.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:27:55,364 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.74 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.01 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6026.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. * Witness Printer took 39.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); [L16] char str1[MAX], str2[MAX]; [L17] int cont, i, j; [L18] cont = 0 [L20] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L20] COND TRUE i= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L27] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L27] COND TRUE i >= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L27] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L27] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L32] j = MAX-1 [L33] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L33] COND TRUE i