./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/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 cc7fef7e01f0cbe23a4bfb5f51eb1c754f7b3b49 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 13:32:29,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:32:29,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:32:29,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:32:29,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:32:29,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:32:29,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:32:29,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:32:29,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:32:29,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:32:29,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:32:29,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:32:29,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:32:29,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:32:29,904 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:32:29,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:32:29,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:32:29,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:32:29,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:32:29,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:32:29,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:32:29,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:32:29,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:32:29,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:32:29,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:32:29,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:32:29,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:32:29,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:32:29,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:32:29,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:32:29,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:32:29,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:32:29,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:32:29,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:32:29,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:32:29,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:32:29,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 13:32:29,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:32:29,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:32:29,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:32:29,925 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:32:29,925 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 13:32:29,925 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 13:32:29,925 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 13:32:29,925 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 13:32:29,926 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 13:32:29,926 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 13:32:29,926 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 13:32:29,926 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 13:32:29,926 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 13:32:29,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:32:29,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:32:29,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:32:29,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:32:29,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:32:29,929 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 13:32:29,929 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_e60dbb8f-5fd9-46b9-9896-5bd94e949504/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 -> cc7fef7e01f0cbe23a4bfb5f51eb1c754f7b3b49 [2018-12-02 13:32:29,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:32:29,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:32:29,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:32:29,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:32:29,957 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:32:29,958 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-12-02 13:32:29,992 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/data/fd48f2f37/53338845b01a438a90aedf4853478883/FLAG69a738ec3 [2018-12-02 13:32:30,396 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:32:30,397 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-12-02 13:32:30,404 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/data/fd48f2f37/53338845b01a438a90aedf4853478883/FLAG69a738ec3 [2018-12-02 13:32:30,743 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/data/fd48f2f37/53338845b01a438a90aedf4853478883 [2018-12-02 13:32:30,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:32:30,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:32:30,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:32:30,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:32:30,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:32:30,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:32:30" (1/1) ... [2018-12-02 13:32:30,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56acabfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:30, skipping insertion in model container [2018-12-02 13:32:30,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:32:30" (1/1) ... [2018-12-02 13:32:30,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:32:30,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:32:30,976 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:32:30,979 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:32:31,026 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:32:31,077 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:32:31,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31 WrapperNode [2018-12-02 13:32:31,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:32:31,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:32:31,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:32:31,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:32:31,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:32:31,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:32:31,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:32:31,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:32:31,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... [2018-12-02 13:32:31,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:32:31,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:32:31,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:32:31,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:32:31,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:32:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 13:32:31,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 13:32:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 13:32:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 13:32:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:32:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:32:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 13:32:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 13:32:31,721 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:32:31,721 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 13:32:31,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:32:31 BoogieIcfgContainer [2018-12-02 13:32:31,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:32:31,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:32:31,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:32:31,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:32:31,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:32:30" (1/3) ... [2018-12-02 13:32:31,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef7f1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:32:31, skipping insertion in model container [2018-12-02 13:32:31,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:32:31" (2/3) ... [2018-12-02 13:32:31,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef7f1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:32:31, skipping insertion in model container [2018-12-02 13:32:31,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:32:31" (3/3) ... [2018-12-02 13:32:31,728 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-12-02 13:32:31,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:32:31,743 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 13:32:31,755 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 13:32:31,782 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:32:31,782 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:32:31,782 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:32:31,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:32:31,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:32:31,782 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:32:31,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:32:31,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:32:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-02 13:32:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 13:32:31,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:31,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:31,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:31,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1251834154, now seen corresponding path program 1 times [2018-12-02 13:32:31,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:31,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:31,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:32:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:32:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:32:32,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:32,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:32:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:32:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:32:32,138 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-02 13:32:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:32,551 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-02 13:32:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:32:32,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-12-02 13:32:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:32,561 INFO L225 Difference]: With dead ends: 547 [2018-12-02 13:32:32,561 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 13:32:32,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:32:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 13:32:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-02 13:32:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 13:32:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2018-12-02 13:32:32,600 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 130 [2018-12-02 13:32:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:32,601 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2018-12-02 13:32:32,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:32:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2018-12-02 13:32:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 13:32:32,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:32,603 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:32,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:32,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash -932424019, now seen corresponding path program 1 times [2018-12-02 13:32:32,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:32,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:32:32,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:32:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:32:32,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:32,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:32:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:32:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:32:32,674 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2018-12-02 13:32:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:33,083 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2018-12-02 13:32:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:32:33,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-12-02 13:32:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:33,087 INFO L225 Difference]: With dead ends: 840 [2018-12-02 13:32:33,087 INFO L226 Difference]: Without dead ends: 568 [2018-12-02 13:32:33,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:32:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-02 13:32:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2018-12-02 13:32:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-02 13:32:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2018-12-02 13:32:33,108 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 140 [2018-12-02 13:32:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:33,108 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2018-12-02 13:32:33,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:32:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2018-12-02 13:32:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 13:32:33,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:33,110 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:33,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:33,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -188990609, now seen corresponding path program 1 times [2018-12-02 13:32:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:33,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:33,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:32:33,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:32:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:32:33,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:33,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:32:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:32:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:32:33,260 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 5 states. [2018-12-02 13:32:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:33,553 INFO L93 Difference]: Finished difference Result 1205 states and 1730 transitions. [2018-12-02 13:32:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:32:33,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-12-02 13:32:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:33,555 INFO L225 Difference]: With dead ends: 1205 [2018-12-02 13:32:33,556 INFO L226 Difference]: Without dead ends: 554 [2018-12-02 13:32:33,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:32:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-02 13:32:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-12-02 13:32:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-12-02 13:32:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2018-12-02 13:32:33,570 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 141 [2018-12-02 13:32:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:33,571 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2018-12-02 13:32:33,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:32:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2018-12-02 13:32:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 13:32:33,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:33,573 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:33,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:33,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1244428519, now seen corresponding path program 1 times [2018-12-02 13:32:33,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:32:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:32:33,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:32:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:32:33,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:32:33,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:32:33,645 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand 3 states. [2018-12-02 13:32:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:33,939 INFO L93 Difference]: Finished difference Result 1509 states and 1963 transitions. [2018-12-02 13:32:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:32:33,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-12-02 13:32:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:33,942 INFO L225 Difference]: With dead ends: 1509 [2018-12-02 13:32:33,942 INFO L226 Difference]: Without dead ends: 961 [2018-12-02 13:32:33,943 INFO L631 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-12-02 13:32:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-02 13:32:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-02 13:32:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-02 13:32:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1189 transitions. [2018-12-02 13:32:33,963 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1189 transitions. Word has length 145 [2018-12-02 13:32:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:33,964 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1189 transitions. [2018-12-02 13:32:33,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:32:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1189 transitions. [2018-12-02 13:32:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 13:32:33,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:33,967 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-02 13:32:33,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:33,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1960590570, now seen corresponding path program 1 times [2018-12-02 13:32:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:33,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 13:32:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:32:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:32:34,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:34,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:32:34,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:32:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:32:34,043 INFO L87 Difference]: Start difference. First operand 959 states and 1189 transitions. Second operand 4 states. [2018-12-02 13:32:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:34,442 INFO L93 Difference]: Finished difference Result 2994 states and 3801 transitions. [2018-12-02 13:32:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:32:34,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 13:32:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:34,448 INFO L225 Difference]: With dead ends: 2994 [2018-12-02 13:32:34,448 INFO L226 Difference]: Without dead ends: 2041 [2018-12-02 13:32:34,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:32:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2018-12-02 13:32:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1231. [2018-12-02 13:32:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-12-02 13:32:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1530 transitions. [2018-12-02 13:32:34,476 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1530 transitions. Word has length 165 [2018-12-02 13:32:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:34,477 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1530 transitions. [2018-12-02 13:32:34,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:32:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1530 transitions. [2018-12-02 13:32:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 13:32:34,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:34,479 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:34,479 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:34,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash 425097878, now seen corresponding path program 1 times [2018-12-02 13:32:34,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:34,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:32:34,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:34,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:32:34,557 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-12-02 13:32:34,559 INFO L205 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], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 13:32:34,596 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:32:34,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:32:34,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:32:34,910 INFO L272 AbstractInterpreter]: Visited 131 different actions 131 times. Never merged. Never widened. Performed 1700 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-02 13:32:34,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:34,915 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:32:35,157 INFO L227 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 80.56% of their original sizes. [2018-12-02 13:32:35,157 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:32:35,180 INFO L418 sIntCurrentIteration]: We unified 175 AI predicates to 175 [2018-12-02 13:32:35,181 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:32:35,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:32:35,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-02 13:32:35,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:35,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:32:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:32:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:32:35,182 INFO L87 Difference]: Start difference. First operand 1231 states and 1530 transitions. Second operand 6 states. [2018-12-02 13:32:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:36,180 INFO L93 Difference]: Finished difference Result 2592 states and 3212 transitions. [2018-12-02 13:32:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:32:36,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-12-02 13:32:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:36,184 INFO L225 Difference]: With dead ends: 2592 [2018-12-02 13:32:36,184 INFO L226 Difference]: Without dead ends: 1367 [2018-12-02 13:32:36,187 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:32:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-02 13:32:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1366. [2018-12-02 13:32:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2018-12-02 13:32:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1671 transitions. [2018-12-02 13:32:36,216 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1671 transitions. Word has length 176 [2018-12-02 13:32:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:36,216 INFO L480 AbstractCegarLoop]: Abstraction has 1366 states and 1671 transitions. [2018-12-02 13:32:36,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:32:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1671 transitions. [2018-12-02 13:32:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-02 13:32:36,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:36,220 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:36,220 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:36,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash -233411727, now seen corresponding path program 1 times [2018-12-02 13:32:36,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:36,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:36,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:36,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 13:32:36,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:36,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:32:36,300 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-12-02 13:32:36,300 INFO L205 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], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 13:32:36,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:32:36,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:32:36,505 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:32:36,505 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 4 different actions 4 times. Never widened. Performed 3404 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3404 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-12-02 13:32:36,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:36,509 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:32:36,712 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 82% of their original sizes. [2018-12-02 13:32:36,712 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:32:36,758 INFO L418 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-12-02 13:32:36,758 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:32:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:32:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 13:32:36,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:36,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:32:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:32:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:32:36,759 INFO L87 Difference]: Start difference. First operand 1366 states and 1671 transitions. Second operand 10 states. [2018-12-02 13:32:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:38,745 INFO L93 Difference]: Finished difference Result 2730 states and 3370 transitions. [2018-12-02 13:32:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:32:38,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-12-02 13:32:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:38,750 INFO L225 Difference]: With dead ends: 2730 [2018-12-02 13:32:38,750 INFO L226 Difference]: Without dead ends: 1505 [2018-12-02 13:32:38,752 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:32:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-12-02 13:32:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2018-12-02 13:32:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-12-02 13:32:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1818 transitions. [2018-12-02 13:32:38,782 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1818 transitions. Word has length 184 [2018-12-02 13:32:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:38,782 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1818 transitions. [2018-12-02 13:32:38,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:32:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1818 transitions. [2018-12-02 13:32:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 13:32:38,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:38,785 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:38,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:38,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1235116403, now seen corresponding path program 1 times [2018-12-02 13:32:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:38,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:38,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 13:32:38,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:38,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:32:38,876 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-12-02 13:32:38,876 INFO L205 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], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 13:32:38,880 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:32:38,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:32:39,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:32:39,002 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 4 different actions 4 times. Never widened. Performed 3471 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3471 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-12-02 13:32:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:39,005 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:32:39,168 INFO L227 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 81.94% of their original sizes. [2018-12-02 13:32:39,168 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:32:39,208 INFO L418 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-12-02 13:32:39,208 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:32:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:32:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 13:32:39,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:39,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:32:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:32:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:32:39,209 INFO L87 Difference]: Start difference. First operand 1503 states and 1818 transitions. Second operand 10 states. [2018-12-02 13:32:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:41,441 INFO L93 Difference]: Finished difference Result 3004 states and 3659 transitions. [2018-12-02 13:32:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 13:32:41,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-12-02 13:32:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:41,445 INFO L225 Difference]: With dead ends: 3004 [2018-12-02 13:32:41,445 INFO L226 Difference]: Without dead ends: 1779 [2018-12-02 13:32:41,446 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 208 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-12-02 13:32:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2018-12-02 13:32:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1777. [2018-12-02 13:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2018-12-02 13:32:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2113 transitions. [2018-12-02 13:32:41,467 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2113 transitions. Word has length 217 [2018-12-02 13:32:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:41,467 INFO L480 AbstractCegarLoop]: Abstraction has 1777 states and 2113 transitions. [2018-12-02 13:32:41,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:32:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2113 transitions. [2018-12-02 13:32:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 13:32:41,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:41,470 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:41,470 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:41,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1226892024, now seen corresponding path program 1 times [2018-12-02 13:32:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:41,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:41,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:41,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 51 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 13:32:41,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:41,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:32:41,565 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-12-02 13:32:41,565 INFO L205 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], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 13:32:41,568 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:32:41,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:32:41,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 13:32:41,935 INFO L272 AbstractInterpreter]: Visited 137 different actions 548 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Performed 7595 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7595 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-12-02 13:32:41,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:41,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 13:32:41,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:41,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:32:41,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:41,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 13:32:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:42,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:32:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 13:32:42,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:32:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 97 proven. 44 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 13:32:42,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 13:32:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 13:32:42,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 13:32:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 13:32:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 13:32:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 13:32:42,200 INFO L87 Difference]: Start difference. First operand 1777 states and 2113 transitions. Second operand 11 states. [2018-12-02 13:32:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:42,996 INFO L93 Difference]: Finished difference Result 3715 states and 4505 transitions. [2018-12-02 13:32:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:32:42,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-12-02 13:32:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:43,000 INFO L225 Difference]: With dead ends: 3715 [2018-12-02 13:32:43,000 INFO L226 Difference]: Without dead ends: 2353 [2018-12-02 13:32:43,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 451 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:32:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-12-02 13:32:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2073. [2018-12-02 13:32:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-12-02 13:32:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 2418 transitions. [2018-12-02 13:32:43,025 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 2418 transitions. Word has length 225 [2018-12-02 13:32:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:43,025 INFO L480 AbstractCegarLoop]: Abstraction has 2073 states and 2418 transitions. [2018-12-02 13:32:43,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 13:32:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2418 transitions. [2018-12-02 13:32:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 13:32:43,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:32:43,029 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:32:43,029 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:32:43,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:32:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1714169166, now seen corresponding path program 2 times [2018-12-02 13:32:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:32:43,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:32:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:32:43,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:32:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:32:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 53 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 13:32:43,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:43,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:32:43,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 13:32:43,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 13:32:43,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:32:43,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:32:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 13:32:43,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 13:32:43,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 13:32:43,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:32:43,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:32:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 13:32:43,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:32:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 13:32:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:32:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-02 13:32:43,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:32:43,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:32:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:32:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:32:43,297 INFO L87 Difference]: Start difference. First operand 2073 states and 2418 transitions. Second operand 3 states. [2018-12-02 13:32:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:32:43,541 INFO L93 Difference]: Finished difference Result 4827 states and 5762 transitions. [2018-12-02 13:32:43,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:32:43,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-12-02 13:32:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:32:43,541 INFO L225 Difference]: With dead ends: 4827 [2018-12-02 13:32:43,541 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 13:32:43,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 449 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-12-02 13:32:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 13:32:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 13:32:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 13:32:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 13:32:43,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2018-12-02 13:32:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:32:43,546 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:32:43,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:32:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 13:32:43,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 13:32:43,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 13:32:43,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:43,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:32:44,348 WARN L180 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 110 [2018-12-02 13:32:44,554 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,556 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,557 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-02 13:32:44,558 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,559 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-02 13:32:44,560 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,561 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-02 13:32:44,562 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,563 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-02 13:32:44,564 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse21 (= |old(~a20~0)| ~a20~0)) (.cse22 (= |old(~a16~0)| ~a16~0)) (.cse0 (= 1 |old(~a7~0)|)) (.cse20 (= 6 |old(~a16~0)|)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse8 (= 13 |old(~a8~0)|)) (.cse2 (not (= 8 ~a12~0)))) (let ((.cse16 (and (or .cse20 .cse0 .cse1 .cse2) (or .cse20 .cse1 .cse8 .cse2))) (.cse13 (= ~a8~0 15)) (.cse17 (not (= ~a8~0 13))) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse7 (not (= 1 |old(~a21~0)|))) (.cse19 (not (= 5 |old(~a16~0)|))) (.cse15 (= |calculate_output_#in~input| 0)) (.cse12 (= ~a7~0 0)) (.cse18 (= ~a17~0 1)) (.cse14 (= ~a21~0 1)) (.cse24 (or .cse20 .cse8 .cse2)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse4 (< 4 |old(~a16~0)|)) (.cse6 (and .cse21 .cse22)) (.cse3 (not (= ~a7~0 1))) (.cse23 (= 15 ~a8~0)) (.cse11 (not (= 15 |old(~a8~0)|))) (.cse5 (< 0 |old(~a20~0)|))) (and (or (or .cse0 .cse1 .cse2) .cse3) (or .cse0 .cse4 .cse3 .cse2 .cse5) (or .cse6 (or .cse1 .cse2)) (or .cse7 .cse1 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 13 ~a8~0) (= 1 ~a21~0) (= 1 ~a17~0)) .cse2 (not .cse0) (not .cse8) .cse9) (or .cse10 .cse7 .cse11 (= 0 |old(~a16~0)|) (and .cse12 .cse13 .cse14) .cse15 .cse16) (or .cse3 .cse16 .cse17) (or (and .cse13 .cse14 (or (and .cse12 (= ~a17~0 0) (= ~a16~0 6)) (and .cse18 (= ~a16~0 5)))) .cse15 (and (or .cse10 .cse7 .cse1 .cse11 .cse19 .cse2 .cse9) (or (not .cse20) .cse10 .cse7 .cse1 .cse11 (not (= 0 |old(~a17~0)|)) .cse2))) (or .cse0 .cse11 .cse2 (and .cse3 .cse21 .cse22 .cse23) .cse5) (or (and (and .cse22 .cse17) .cse21) .cse24 .cse5) (or (or .cse10 .cse7 .cse11 (not (= 0 |old(~a20~0)|)) .cse19) .cse15 (and .cse12 .cse18 .cse14) .cse24 .cse9) (or .cse4 .cse6 .cse2 .cse5) (or (or .cse3 .cse23) (and (or .cse20 .cse11 .cse2) (or .cse20 .cse0 .cse8 .cse2)) .cse5)))) [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-02 13:32:44,565 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-02 13:32:44,566 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,567 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= 15 ~a8~0) (= ~a16~0 5)) [2018-12-02 13:32:44,568 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 13:32:44,568 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 13:32:44,568 INFO L444 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)|)) (and (= ~a17~0 1) (= ~a21~0 1) (= 15 ~a8~0) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-12-02 13:32:44,569 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-02 13:32:44,569 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) .cse0) (not (= 0 |old(~a7~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)))) [2018-12-02 13:32:44,569 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-02 13:32:44,569 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-02 13:32:44,569 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) .cse0) (not (= 0 |old(~a7~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)))) [2018-12-02 13:32:44,569 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-02 13:32:44,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:32:44 BoogieIcfgContainer [2018-12-02 13:32:44,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:32:44,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:32:44,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:32:44,578 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:32:44,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:32:31" (3/4) ... [2018-12-02 13:32:44,581 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 13:32:44,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 13:32:44,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 13:32:44,586 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 13:32:44,594 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 13:32:44,594 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 13:32:44,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || ((!(a16 == 6) && !(a8 == 13)) && a20 <= 0)) || !(0 == \old(a7))) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(15 == \old(a8)) [2018-12-02 13:32:44,655 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e60dbb8f-5fd9-46b9-9896-5bd94e949504/bin-2019/utaipan/witness.graphml [2018-12-02 13:32:44,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:32:44,656 INFO L168 Benchmark]: Toolchain (without parser) took 13906.49 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 753.4 MB). Free memory was 950.6 MB in the beginning and 1.5 GB in the end (delta: -588.1 MB). Peak memory consumption was 165.3 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,656 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: RCFGBuilder took 587.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.5 MB in the end (delta: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: TraceAbstraction took 12855.10 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 653.3 MB). Free memory was 973.5 MB in the beginning and 1.6 GB in the end (delta: -584.0 MB). Peak memory consumption was 922.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,657 INFO L168 Benchmark]: Witness Printer took 77.70 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:32:44,658 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 587.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.5 MB in the end (delta: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12855.10 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 653.3 MB). Free memory was 973.5 MB in the beginning and 1.6 GB in the end (delta: -584.0 MB). Peak memory consumption was 922.0 MB. Max. memory is 11.5 GB. * Witness Printer took 77.70 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: (((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || ((!(a16 == 6) && !(a8 == 13)) && a20 <= 0)) || !(0 == \old(a7))) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(15 == \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 591 SDtfs, 4027 SDslu, 367 SDs, 0 SdLazy, 5593 SolverSat, 743 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1553 GetRequests, 1467 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2073occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975028325019722 AbsIntWeakeningRatio, 0.2038327526132404 AbsIntAvgWeakeningVarsNumRemoved, 29.78745644599303 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1109 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 97 PreInvPairs, 143 NumberOfFragments, 657 HoareAnnotationTreeSize, 97 FomulaSimplifications, 3868 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3077 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2634 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407851 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1167/1349 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...