./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/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 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:09:17,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:09:17,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:09:17,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:09:17,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:09:17,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:09:17,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:09:17,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:09:17,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:09:17,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:09:17,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:09:17,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:09:17,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:09:17,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:09:17,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:09:17,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:09:17,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:09:17,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:09:17,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:09:17,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:09:17,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:09:17,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:09:18,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:09:18,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:09:18,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:09:18,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:09:18,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:09:18,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:09:18,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:09:18,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:09:18,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:09:18,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:09:18,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:09:18,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:09:18,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:09:18,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:09:18,021 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:09:18,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:09:18,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:09:18,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:09:18,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:09:18,049 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:09:18,050 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:09:18,050 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:09:18,050 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:09:18,051 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:09:18,051 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:09:18,051 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:09:18,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:09:18,051 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:09:18,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:09:18,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:09:18,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:09:18,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:09:18,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:09:18,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:09:18,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:09:18,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:09:18,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:09:18,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:09:18,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:09:18,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:09:18,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:09:18,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:09:18,064 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:09:18,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:09:18,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:09:18,065 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:09:18,065 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_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/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 -> 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 [2018-11-18 10:09:18,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:09:18,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:09:18,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:09:18,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:09:18,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:09:18,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-11-18 10:09:18,270 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/data/d8553af5e/52f82b15c94f48dcbdb6534293353d9e/FLAGa1f6d7025 [2018-11-18 10:09:19,011 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:09:19,011 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-11-18 10:09:19,019 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/data/d8553af5e/52f82b15c94f48dcbdb6534293353d9e/FLAGa1f6d7025 [2018-11-18 10:09:19,155 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/data/d8553af5e/52f82b15c94f48dcbdb6534293353d9e [2018-11-18 10:09:19,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:09:19,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:09:19,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:09:19,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:09:19,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:09:19,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:19,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34924e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19, skipping insertion in model container [2018-11-18 10:09:19,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:19,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:09:19,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:09:19,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:09:19,809 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:09:19,952 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:09:19,990 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:09:19,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19 WrapperNode [2018-11-18 10:09:19,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:09:19,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:09:19,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:09:19,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:09:20,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:09:20,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:09:20,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:09:20,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:09:20,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... [2018-11-18 10:09:20,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:09:20,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:09:20,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:09:20,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:09:20,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:09:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 10:09:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:09:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:09:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 10:09:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 10:09:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:09:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:09:20,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:09:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:09:28,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:09:28,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:09:28 BoogieIcfgContainer [2018-11-18 10:09:28,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:09:28,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:09:28,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:09:28,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:09:28,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:09:19" (1/3) ... [2018-11-18 10:09:28,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd1851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:09:28, skipping insertion in model container [2018-11-18 10:09:28,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:19" (2/3) ... [2018-11-18 10:09:28,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd1851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:09:28, skipping insertion in model container [2018-11-18 10:09:28,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:09:28" (3/3) ... [2018-11-18 10:09:28,103 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-11-18 10:09:28,111 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:09:28,127 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:09:28,147 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:09:28,190 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:09:28,190 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:09:28,191 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:09:28,191 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:09:28,191 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:09:28,191 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:09:28,191 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:09:28,191 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:09:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 10:09:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 10:09:28,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:28,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:28,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:28,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1391094344, now seen corresponding path program 1 times [2018-11-18 10:09:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:28,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:28,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:29,284 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-18 10:09:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:29,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:09:29,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:09:29,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:29,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:09:29,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:09:29,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:09:29,468 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 10:09:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:09:37,009 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 10:09:37,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:09:37,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-11-18 10:09:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:09:37,021 INFO L225 Difference]: With dead ends: 550 [2018-11-18 10:09:37,021 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 10:09:37,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:09:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 10:09:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 10:09:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 10:09:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-11-18 10:09:37,074 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 124 [2018-11-18 10:09:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:09:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-11-18 10:09:37,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:09:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-11-18 10:09:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 10:09:37,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:37,081 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:37,081 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:37,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash -624789737, now seen corresponding path program 1 times [2018-11-18 10:09:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:37,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:37,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:37,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:37,303 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-18 10:09:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:37,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:09:37,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:09:37,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:09:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:09:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:09:37,364 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-11-18 10:09:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:09:40,831 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-11-18 10:09:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:09:40,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-18 10:09:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:09:40,840 INFO L225 Difference]: With dead ends: 1075 [2018-11-18 10:09:40,841 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 10:09:40,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:09:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 10:09:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-18 10:09:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-18 10:09:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-11-18 10:09:40,874 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 135 [2018-11-18 10:09:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:09:40,875 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-11-18 10:09:40,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:09:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-11-18 10:09:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 10:09:40,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:40,879 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:40,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:40,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash -39605397, now seen corresponding path program 1 times [2018-11-18 10:09:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:40,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:41,286 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-11-18 10:09:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:41,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:09:41,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:09:41,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:41,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:09:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:09:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:09:41,533 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-11-18 10:09:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:09:43,049 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-11-18 10:09:43,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:09:43,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-18 10:09:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:09:43,053 INFO L225 Difference]: With dead ends: 1578 [2018-11-18 10:09:43,054 INFO L226 Difference]: Without dead ends: 721 [2018-11-18 10:09:43,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:09:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-18 10:09:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-18 10:09:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-18 10:09:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-11-18 10:09:43,082 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 136 [2018-11-18 10:09:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:09:43,083 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-11-18 10:09:43,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:09:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-11-18 10:09:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 10:09:43,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:43,086 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:43,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:43,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1115389459, now seen corresponding path program 1 times [2018-11-18 10:09:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:43,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:43,650 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-18 10:09:43,780 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-18 10:09:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:43,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:09:43,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:09:43,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:43,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:09:43,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:09:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:09:43,844 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-11-18 10:09:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:09:44,798 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-11-18 10:09:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:09:44,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-18 10:09:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:09:44,806 INFO L225 Difference]: With dead ends: 1572 [2018-11-18 10:09:44,808 INFO L226 Difference]: Without dead ends: 720 [2018-11-18 10:09:44,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:09:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-18 10:09:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-18 10:09:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-18 10:09:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-11-18 10:09:44,832 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 137 [2018-11-18 10:09:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:09:44,832 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-11-18 10:09:44,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:09:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-11-18 10:09:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 10:09:44,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:44,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:44,836 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:44,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1083310493, now seen corresponding path program 1 times [2018-11-18 10:09:44,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:44,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:44,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:44,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:44,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:44,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:09:44,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:09:44,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:44,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:09:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:09:44,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:09:44,976 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-11-18 10:09:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:09:45,760 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-11-18 10:09:45,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:09:45,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-18 10:09:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:09:45,764 INFO L225 Difference]: With dead ends: 1882 [2018-11-18 10:09:45,764 INFO L226 Difference]: Without dead ends: 1168 [2018-11-18 10:09:45,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:09:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-18 10:09:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-11-18 10:09:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-18 10:09:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-11-18 10:09:45,791 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 140 [2018-11-18 10:09:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:09:45,791 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-11-18 10:09:45,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:09:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-11-18 10:09:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 10:09:45,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:09:45,795 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:09:45,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:09:45,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1130743534, now seen corresponding path program 1 times [2018-11-18 10:09:45,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:09:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:45,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:09:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:09:45,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:09:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:09:45,978 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-18 10:09:46,442 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-18 10:09:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:09:46,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:09:46,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:09:46,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-18 10:09:46,599 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 10:09:46,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:09:46,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:09:47,079 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:09:47,081 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Performed 1630 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1630 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-18 10:09:47,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:09:47,131 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:09:47,664 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 80.51% of their original sizes. [2018-11-18 10:09:47,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:09:47,915 INFO L415 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2018-11-18 10:09:47,915 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:09:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:09:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 10:09:47,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:09:47,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:09:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:09:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:09:47,916 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 6 states. [2018-11-18 10:10:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:10:00,130 INFO L93 Difference]: Finished difference Result 2460 states and 3350 transitions. [2018-11-18 10:10:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:10:00,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-18 10:10:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:10:00,134 INFO L225 Difference]: With dead ends: 2460 [2018-11-18 10:10:00,134 INFO L226 Difference]: Without dead ends: 1302 [2018-11-18 10:10:00,136 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:10:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-11-18 10:10:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1300. [2018-11-18 10:10:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-11-18 10:10:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1734 transitions. [2018-11-18 10:10:00,182 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1734 transitions. Word has length 172 [2018-11-18 10:10:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:10:00,182 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1734 transitions. [2018-11-18 10:10:00,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:10:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1734 transitions. [2018-11-18 10:10:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 10:10:00,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:10:00,195 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:10:00,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:10:00,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -782139567, now seen corresponding path program 1 times [2018-11-18 10:10:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:10:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:00,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:10:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:00,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:10:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:10:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:10:00,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:00,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:10:00,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-18 10:10:00,564 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 10:10:00,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:10:00,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:10:00,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:10:00,835 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Performed 3258 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 10:10:00,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:00,871 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:10:01,173 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 81.93% of their original sizes. [2018-11-18 10:10:01,173 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:10:01,240 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-18 10:10:01,240 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:10:01,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:10:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 10:10:01,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:10:01,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:10:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:10:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:10:01,242 INFO L87 Difference]: Start difference. First operand 1300 states and 1734 transitions. Second operand 10 states. [2018-11-18 10:10:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:10:03,388 INFO L93 Difference]: Finished difference Result 2599 states and 3521 transitions. [2018-11-18 10:10:03,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:10:03,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2018-11-18 10:10:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:10:03,392 INFO L225 Difference]: With dead ends: 2599 [2018-11-18 10:10:03,392 INFO L226 Difference]: Without dead ends: 1441 [2018-11-18 10:10:03,394 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:10:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-11-18 10:10:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1438. [2018-11-18 10:10:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-11-18 10:10:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2018-11-18 10:10:03,414 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 181 [2018-11-18 10:10:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:10:03,414 INFO L480 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2018-11-18 10:10:03,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:10:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2018-11-18 10:10:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 10:10:03,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:10:03,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:10:03,417 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:10:03,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash -216405787, now seen corresponding path program 1 times [2018-11-18 10:10:03,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:10:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:10:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:03,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:10:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:10:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:10:03,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:03,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:10:03,507 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-18 10:10:03,507 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 10:10:03,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:10:03,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:10:03,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:10:03,627 INFO L272 AbstractInterpreter]: Visited 129 different actions 252 times. Merged at 5 different actions 5 times. Never widened. Performed 3329 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3329 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 10:10:03,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:03,634 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:10:03,897 INFO L227 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 81.87% of their original sizes. [2018-11-18 10:10:03,898 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:10:03,969 INFO L415 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-11-18 10:10:03,969 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:10:03,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:10:03,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 10:10:03,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:10:03,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:10:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:10:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:10:03,971 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand 10 states. [2018-11-18 10:10:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:10:05,919 INFO L93 Difference]: Finished difference Result 2876 states and 3820 transitions. [2018-11-18 10:10:05,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 10:10:05,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-11-18 10:10:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:10:05,924 INFO L225 Difference]: With dead ends: 2876 [2018-11-18 10:10:05,924 INFO L226 Difference]: Without dead ends: 1718 [2018-11-18 10:10:05,927 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 10:10:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-11-18 10:10:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1715. [2018-11-18 10:10:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-11-18 10:10:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2181 transitions. [2018-11-18 10:10:05,957 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2181 transitions. Word has length 214 [2018-11-18 10:10:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:10:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 1715 states and 2181 transitions. [2018-11-18 10:10:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:10:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2181 transitions. [2018-11-18 10:10:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 10:10:05,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:10:05,963 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:10:05,963 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:10:05,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2026015352, now seen corresponding path program 1 times [2018-11-18 10:10:05,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:10:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:10:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:05,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:10:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:10:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 10:10:06,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:06,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:10:06,096 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-11-18 10:10:06,097 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 10:10:06,099 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:10:06,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:10:06,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:10:06,492 INFO L272 AbstractInterpreter]: Visited 131 different actions 528 times. Merged at 9 different actions 40 times. Widened at 1 different actions 1 times. Performed 7299 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 10:10:06,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:06,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:10:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:06,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/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-11-18 10:10:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:10:06,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:10:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:10:06,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:10:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 10:10:06,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:10:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 10:10:06,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:10:06,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 10:10:06,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:10:06,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:10:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:10:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:10:06,851 INFO L87 Difference]: Start difference. First operand 1715 states and 2181 transitions. Second operand 11 states. [2018-11-18 10:10:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:10:07,825 INFO L93 Difference]: Finished difference Result 3589 states and 4709 transitions. [2018-11-18 10:10:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:10:07,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-11-18 10:10:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:10:07,830 INFO L225 Difference]: With dead ends: 3589 [2018-11-18 10:10:07,830 INFO L226 Difference]: Without dead ends: 2293 [2018-11-18 10:10:07,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:10:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2018-11-18 10:10:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2285. [2018-11-18 10:10:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-11-18 10:10:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2863 transitions. [2018-11-18 10:10:07,859 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2863 transitions. Word has length 223 [2018-11-18 10:10:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:10:07,860 INFO L480 AbstractCegarLoop]: Abstraction has 2285 states and 2863 transitions. [2018-11-18 10:10:07,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:10:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2863 transitions. [2018-11-18 10:10:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 10:10:07,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:10:07,864 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:10:07,865 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:10:07,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:10:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1231117510, now seen corresponding path program 2 times [2018-11-18 10:10:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:10:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:10:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:10:07,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:10:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:10:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 10:10:07,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:07,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:10:07,943 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 10:10:07,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 10:10:07,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:10:07,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/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-11-18 10:10:07,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:10:07,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 10:10:07,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 10:10:07,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:10:08,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:10:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 10:10:08,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:10:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 10:10:08,162 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:10:08,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 10:10:08,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:10:08,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:10:08,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:10:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:10:08,164 INFO L87 Difference]: Start difference. First operand 2285 states and 2863 transitions. Second operand 3 states. [2018-11-18 10:10:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:10:08,505 INFO L93 Difference]: Finished difference Result 5115 states and 6588 transitions. [2018-11-18 10:10:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:10:08,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-18 10:10:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:10:08,505 INFO L225 Difference]: With dead ends: 5115 [2018-11-18 10:10:08,505 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:10:08,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:10:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:10:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:10:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:10:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:10:08,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2018-11-18 10:10:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:10:08,512 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:10:08,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:10:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:10:08,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:10:08,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:10:09,038 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2018-11-18 10:10:09,133 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-18 10:10:09,134 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-18 10:10:09,135 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,136 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,137 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-18 10:10:09,138 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-18 10:10:09,139 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-18 10:10:09,140 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,141 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-18 10:10:09,142 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse23 (= |old(~a20~0)| ~a20~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse19 (= 13 |old(~a8~0)|))) (let ((.cse14 (not (= 5 |old(~a16~0)|))) (.cse12 (= ~a17~0 1)) (.cse3 (not (= 4 |old(~a16~0)|))) (.cse5 (= 13 ~a8~0)) (.cse6 (= 1 ~a21~0)) (.cse7 (= 1 ~a17~0)) (.cse1 (= 1 |old(~a7~0)|)) (.cse8 (not .cse19)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse20 (and .cse23 .cse24)) (.cse11 (= |calculate_output_#in~input| 0)) (.cse16 (= ~a8~0 15)) (.cse17 (= ~a21~0 1)) (.cse15 (= ~a7~0 0)) (.cse21 (= 6 |old(~a16~0)|)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse18 (not (= ~a8~0 13))) (.cse4 (not (= 8 ~a12~0))) (.cse22 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~a7~0 1)) .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse0 .cse4 .cse11 .cse9 .cse12 .cse2 .cse13 .cse14) (or (or .cse10 .cse0 .cse13 (not (= 0 |old(~a20~0)|)) .cse14 .cse4) .cse11 (and .cse15 .cse16 .cse12 .cse17) .cse9) (or .cse2 .cse18 .cse19 .cse4) (or .cse0 .cse2 .cse3 (and (= 1 ~a7~0) .cse5 .cse6 .cse7) .cse4 (not .cse1) .cse8 .cse9) (or .cse2 .cse20 .cse4) (or .cse21 .cse10 .cse0 .cse2 .cse13 (= 0 |old(~a16~0)|) .cse4 .cse11 (and .cse16 .cse17 .cse15)) (or (< 4 |old(~a16~0)|) .cse20 .cse4 .cse22) (or .cse11 (and .cse16 .cse17 (= ~a17~0 0) .cse15) (or (not .cse21) .cse10 .cse0 .cse2 .cse13 (not (= 0 |old(~a17~0)|)) .cse4)) (or (and .cse23 .cse24 .cse18) .cse19 .cse4 .cse22)))) [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-18 10:10:09,143 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,144 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,145 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-18 10:10:09,146 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:10:09,146 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-11-18 10:10:09,146 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-18 10:10:09,147 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-18 10:10:09,147 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-18 10:10:09,147 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-18 10:10:09,147 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-18 10:10:09,147 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-18 10:10:09,147 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-18 10:10:09,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:10:09 BoogieIcfgContainer [2018-11-18 10:10:09,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:10:09,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:10:09,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:10:09,163 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:10:09,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:09:28" (3/4) ... [2018-11-18 10:10:09,166 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:10:09,170 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:10:09,171 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 10:10:09,171 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:10:09,179 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 10:10:09,180 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 10:10:09,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) [2018-11-18 10:10:09,272 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_970a3a6b-d9a6-4c30-a444-a04ba5b9d1f7/bin-2019/utaipan/witness.graphml [2018-11-18 10:10:09,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:10:09,273 INFO L168 Benchmark]: Toolchain (without parser) took 50106.39 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 847.2 MB). Free memory was 954.4 MB in the beginning and 1.4 GB in the end (delta: -400.8 MB). Peak memory consumption was 446.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,273 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:10:09,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.32 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 924.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 257.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 922.2 MB in the beginning and 1.2 GB in the end (delta: -228.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,274 INFO L168 Benchmark]: Boogie Preprocessor took 149.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,274 INFO L168 Benchmark]: RCFGBuilder took 7690.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,275 INFO L168 Benchmark]: TraceAbstraction took 41065.16 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -337.8 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,275 INFO L168 Benchmark]: Witness Printer took 109.88 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:10:09,276 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 830.32 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 924.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 257.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 922.2 MB in the beginning and 1.2 GB in the end (delta: -228.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 149.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7690.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41065.16 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -337.8 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. * Witness Printer took 109.88 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 40.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 31.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1381 SDtfs, 4884 SDslu, 1304 SDs, 0 SdLazy, 7068 SolverSat, 1145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1538 GetRequests, 1448 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2285occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9974585564825035 AbsIntWeakeningRatio, 0.2074468085106383 AbsIntAvgWeakeningVarsNumRemoved, 29.28191489361702 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 86 PreInvPairs, 132 NumberOfFragments, 499 HoareAnnotationTreeSize, 86 FomulaSimplifications, 1865 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1346 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2064 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2563 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557056 SizeOfPredicates, 3 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1209/1393 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...