./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/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_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/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-5842f4b [2018-11-18 12:56:53,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:56:53,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:56:53,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:56:53,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:56:53,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:56:53,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:56:53,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:56:53,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:56:53,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:56:53,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:56:53,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:56:53,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:56:53,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:56:53,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:56:53,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:56:53,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:56:53,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:56:53,983 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:56:53,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:56:53,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:56:53,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:56:53,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:56:53,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:56:53,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:56:53,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:56:53,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:56:53,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:56:53,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:56:53,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:56:53,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:56:53,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:56:53,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:56:53,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:56:53,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:56:53,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:56:53,993 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:56:54,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:56:54,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:56:54,004 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:56:54,005 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:56:54,005 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:56:54,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:56:54,006 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:56:54,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:56:54,007 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:56:54,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:56:54,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:56:54,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:56:54,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:56:54,009 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_125639db-84b6-4d7b-923f-b0d5c6d51d22/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-11-18 12:56:54,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:56:54,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:56:54,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:56:54,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:56:54,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:56:54,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-11-18 12:56:54,098 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/data/97383dba9/51ca2af3a6b447fa9cb772f1b417e7e6/FLAGe2604771d [2018-11-18 12:56:54,595 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:56:54,595 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/sv-benchmarks/c/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-11-18 12:56:54,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/data/97383dba9/51ca2af3a6b447fa9cb772f1b417e7e6/FLAGe2604771d [2018-11-18 12:56:55,072 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/data/97383dba9/51ca2af3a6b447fa9cb772f1b417e7e6 [2018-11-18 12:56:55,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:56:55,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:56:55,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:56:55,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:56:55,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:56:55,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55, skipping insertion in model container [2018-11-18 12:56:55,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:56:55,153 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:56:55,500 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:56:55,519 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:56:55,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:56:55,705 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:56:55,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55 WrapperNode [2018-11-18 12:56:55,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:56:55,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:56:55,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:56:55,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:56:55,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:56:55,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:56:55,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:56:55,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:56:55,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:55,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:56,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... [2018-11-18 12:56:56,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:56:56,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:56:56,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:56:56,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:56:56,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:56:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 12:56:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:56:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:56:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 12:56:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 12:56:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:56:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:56:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:56:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:56:58,432 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:56:58,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:56:58 BoogieIcfgContainer [2018-11-18 12:56:58,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:56:58,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:56:58,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:56:58,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:56:58,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:56:55" (1/3) ... [2018-11-18 12:56:58,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:56:58, skipping insertion in model container [2018-11-18 12:56:58,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:56:55" (2/3) ... [2018-11-18 12:56:58,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:56:58, skipping insertion in model container [2018-11-18 12:56:58,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:56:58" (3/3) ... [2018-11-18 12:56:58,444 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-11-18 12:56:58,452 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:56:58,458 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:56:58,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:56:58,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:56:58,490 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:56:58,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:56:58,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:56:58,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:56:58,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:56:58,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:56:58,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:56:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 12:56:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 12:56:58,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:56:58,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:56:58,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:56:58,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:56:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 482475453, now seen corresponding path program 1 times [2018-11-18 12:56:58,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:56:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:56:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:56:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:56:58,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:56:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:56:59,026 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-18 12:56:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:56:59,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:56:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:56:59,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:56:59,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:56:59,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:56:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:56:59,127 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 12:56:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:56:59,876 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 12:56:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:56:59,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-18 12:56:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:56:59,888 INFO L225 Difference]: With dead ends: 550 [2018-11-18 12:56:59,888 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 12:56:59,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:56:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 12:56:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 12:56:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 12:56:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-11-18 12:56:59,935 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 131 [2018-11-18 12:56:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:56:59,936 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-11-18 12:56:59,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:56:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-11-18 12:56:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 12:56:59,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:56:59,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:56:59,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:56:59,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:56:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -359292034, now seen corresponding path program 1 times [2018-11-18 12:56:59,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:56:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:56:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:56:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:56:59,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:56:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:57:00,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:57:00,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:57:00,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:57:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:57:00,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:57:00,081 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-11-18 12:57:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:00,909 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-11-18 12:57:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:57:00,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-18 12:57:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:00,917 INFO L225 Difference]: With dead ends: 1075 [2018-11-18 12:57:00,917 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 12:57:00,921 INFO L604 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-11-18 12:57:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 12:57:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-18 12:57:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-18 12:57:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-11-18 12:57:00,959 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 142 [2018-11-18 12:57:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:00,959 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-11-18 12:57:00,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:57:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-11-18 12:57:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 12:57:00,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:00,964 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:00,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:00,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -879449942, now seen corresponding path program 1 times [2018-11-18 12:57:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:00,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:01,330 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 12:57:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:57:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:57:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:57:01,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:01,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:57:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:57:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:57:01,430 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-11-18 12:57:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:02,390 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-11-18 12:57:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:57:02,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-18 12:57:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:02,398 INFO L225 Difference]: With dead ends: 1578 [2018-11-18 12:57:02,398 INFO L226 Difference]: Without dead ends: 721 [2018-11-18 12:57:02,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:57:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-18 12:57:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-18 12:57:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-18 12:57:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-11-18 12:57:02,421 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 143 [2018-11-18 12:57:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:02,421 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-11-18 12:57:02,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:57:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-11-18 12:57:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 12:57:02,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:02,425 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:02,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:02,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 353210034, now seen corresponding path program 1 times [2018-11-18 12:57:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:02,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:57:02,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:57:02,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:57:02,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:02,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:57:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:57:02,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:57:02,568 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-11-18 12:57:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:03,952 INFO L93 Difference]: Finished difference Result 1871 states and 2749 transitions. [2018-11-18 12:57:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:57:03,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-18 12:57:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:03,961 INFO L225 Difference]: With dead ends: 1871 [2018-11-18 12:57:03,961 INFO L226 Difference]: Without dead ends: 1156 [2018-11-18 12:57:03,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:57:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-11-18 12:57:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2018-11-18 12:57:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-18 12:57:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1553 transitions. [2018-11-18 12:57:03,997 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1553 transitions. Word has length 147 [2018-11-18 12:57:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:03,999 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1553 transitions. [2018-11-18 12:57:03,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:57:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1553 transitions. [2018-11-18 12:57:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 12:57:04,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:04,004 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:04,004 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:04,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2123069123, now seen corresponding path program 1 times [2018-11-18 12:57:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:04,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:04,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 12:57:04,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:57:04,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:57:04,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:04,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:57:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:57:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:57:04,274 INFO L87 Difference]: Start difference. First operand 1153 states and 1553 transitions. Second operand 4 states. [2018-11-18 12:57:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:05,095 INFO L93 Difference]: Finished difference Result 3973 states and 5595 transitions. [2018-11-18 12:57:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:57:05,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-18 12:57:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:05,108 INFO L225 Difference]: With dead ends: 3973 [2018-11-18 12:57:05,108 INFO L226 Difference]: Without dead ends: 2826 [2018-11-18 12:57:05,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:57:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-11-18 12:57:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2796. [2018-11-18 12:57:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-11-18 12:57:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3650 transitions. [2018-11-18 12:57:05,182 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3650 transitions. Word has length 168 [2018-11-18 12:57:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:05,182 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 3650 transitions. [2018-11-18 12:57:05,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:57:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3650 transitions. [2018-11-18 12:57:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 12:57:05,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:05,192 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:05,192 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:05,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash -813161529, now seen corresponding path program 1 times [2018-11-18 12:57:05,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:05,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:05,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:05,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:57:05,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:05,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:57:05,420 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-18 12:57:05,422 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 12:57:05,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:57:05,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:57:05,922 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:57:05,923 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 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-11-18 12:57:05,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:05,984 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:57:06,460 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 80.59% of their original sizes. [2018-11-18 12:57:06,461 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:57:06,531 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-18 12:57:06,532 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:57:06,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:57:06,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 12:57:06,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:57:06,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:57:06,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:57:06,539 INFO L87 Difference]: Start difference. First operand 2796 states and 3650 transitions. Second operand 6 states. [2018-11-18 12:57:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:11,478 INFO L93 Difference]: Finished difference Result 5724 states and 7459 transitions. [2018-11-18 12:57:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:57:11,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-11-18 12:57:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:11,485 INFO L225 Difference]: With dead ends: 5724 [2018-11-18 12:57:11,485 INFO L226 Difference]: Without dead ends: 2934 [2018-11-18 12:57:11,491 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:57:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2018-11-18 12:57:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2932. [2018-11-18 12:57:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2932 states. [2018-11-18 12:57:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3792 transitions. [2018-11-18 12:57:11,569 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3792 transitions. Word has length 179 [2018-11-18 12:57:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 2932 states and 3792 transitions. [2018-11-18 12:57:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:57:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3792 transitions. [2018-11-18 12:57:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 12:57:11,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:11,579 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:11,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:11,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1518221820, now seen corresponding path program 1 times [2018-11-18 12:57:11,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:11,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:57:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:11,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:57:11,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-18 12:57:11,920 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 12:57:11,923 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:57:11,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:57:12,223 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:57:12,223 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 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-11-18 12:57:12,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:12,247 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:57:12,514 INFO L227 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 82.01% of their original sizes. [2018-11-18 12:57:12,514 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:57:13,384 INFO L415 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-11-18 12:57:13,385 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:57:13,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:57:13,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 12:57:13,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:57:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:57:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:57:13,386 INFO L87 Difference]: Start difference. First operand 2932 states and 3792 transitions. Second operand 10 states. [2018-11-18 12:57:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:17,452 INFO L93 Difference]: Finished difference Result 5863 states and 7618 transitions. [2018-11-18 12:57:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:57:17,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-11-18 12:57:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:17,461 INFO L225 Difference]: With dead ends: 5863 [2018-11-18 12:57:17,461 INFO L226 Difference]: Without dead ends: 3073 [2018-11-18 12:57:17,469 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:57:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2018-11-18 12:57:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3070. [2018-11-18 12:57:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-11-18 12:57:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3940 transitions. [2018-11-18 12:57:17,532 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3940 transitions. Word has length 188 [2018-11-18 12:57:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:17,532 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 3940 transitions. [2018-11-18 12:57:17,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:57:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3940 transitions. [2018-11-18 12:57:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 12:57:17,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:17,543 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:17,543 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:17,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 241118704, now seen corresponding path program 1 times [2018-11-18 12:57:17,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:17,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 12:57:17,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:17,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:57:17,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-18 12:57:17,745 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 12:57:17,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:57:17,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:57:17,920 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:57:17,920 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 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-11-18 12:57:17,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:17,932 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:57:18,277 INFO L227 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 81.95% of their original sizes. [2018-11-18 12:57:18,277 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:57:18,367 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-18 12:57:18,367 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:57:18,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:57:18,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 12:57:18,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:57:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:57:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:57:18,368 INFO L87 Difference]: Start difference. First operand 3070 states and 3940 transitions. Second operand 10 states. [2018-11-18 12:57:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:25,722 INFO L93 Difference]: Finished difference Result 6140 states and 7912 transitions. [2018-11-18 12:57:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:57:25,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-11-18 12:57:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:25,733 INFO L225 Difference]: With dead ends: 6140 [2018-11-18 12:57:25,733 INFO L226 Difference]: Without dead ends: 3350 [2018-11-18 12:57:25,739 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:57:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2018-11-18 12:57:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3347. [2018-11-18 12:57:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3347 states. [2018-11-18 12:57:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4239 transitions. [2018-11-18 12:57:25,801 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4239 transitions. Word has length 221 [2018-11-18 12:57:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:25,801 INFO L480 AbstractCegarLoop]: Abstraction has 3347 states and 4239 transitions. [2018-11-18 12:57:25,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:57:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4239 transitions. [2018-11-18 12:57:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 12:57:25,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:25,814 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:25,815 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1707455469, now seen corresponding path program 1 times [2018-11-18 12:57:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:25,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:25,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 12:57:26,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:26,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:57:26,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-18 12:57:26,159 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 12:57:26,162 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:57:26,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:57:26,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:57:26,494 INFO L272 AbstractInterpreter]: Visited 138 different actions 552 times. Merged at 9 different actions 36 times. Never widened. Performed 7564 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 12:57:26,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:26,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:57:26,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:26,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:57:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:26,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:57:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:26,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:57:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 12:57:26,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:57:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 12:57:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:57:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 12:57:26,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:57:26,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:57:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:57:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:57:26,962 INFO L87 Difference]: Start difference. First operand 3347 states and 4239 transitions. Second operand 11 states. [2018-11-18 12:57:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:27,971 INFO L93 Difference]: Finished difference Result 7283 states and 9388 transitions. [2018-11-18 12:57:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 12:57:27,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-11-18 12:57:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:27,983 INFO L225 Difference]: With dead ends: 7283 [2018-11-18 12:57:27,984 INFO L226 Difference]: Without dead ends: 4355 [2018-11-18 12:57:27,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:57:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2018-11-18 12:57:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4211. [2018-11-18 12:57:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4211 states. [2018-11-18 12:57:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5270 transitions. [2018-11-18 12:57:28,066 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5270 transitions. Word has length 230 [2018-11-18 12:57:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:28,066 INFO L480 AbstractCegarLoop]: Abstraction has 4211 states and 5270 transitions. [2018-11-18 12:57:28,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:57:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5270 transitions. [2018-11-18 12:57:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 12:57:28,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:57:28,146 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:57:28,147 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:57:28,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:57:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash 649665019, now seen corresponding path program 2 times [2018-11-18 12:57:28,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:57:28,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:28,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:57:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:57:28,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:57:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:57:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 12:57:28,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:28,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:57:28,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 12:57:28,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 12:57:28,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:57:28,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:57:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:57:28,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 12:57:28,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 12:57:28,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:57:28,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:57:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 12:57:28,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:57:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 12:57:28,862 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:57:28,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 12:57:28,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:57:28,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:57:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:57:28,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:57:28,863 INFO L87 Difference]: Start difference. First operand 4211 states and 5270 transitions. Second operand 3 states. [2018-11-18 12:57:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:57:29,539 INFO L93 Difference]: Finished difference Result 9785 states and 12545 transitions. [2018-11-18 12:57:29,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:57:29,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-18 12:57:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:57:29,541 INFO L225 Difference]: With dead ends: 9785 [2018-11-18 12:57:29,541 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:57:29,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 459 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:57:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:57:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:57:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:57:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:57:29,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2018-11-18 12:57:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:57:29,567 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:57:29,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:57:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:57:29,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:57:29,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:57:29,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:57:30,512 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 94 [2018-11-18 12:57:30,664 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:57:30,664 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-18 12:57:30,665 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-18 12:57:30,666 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,667 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,668 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,669 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-18 12:57:30,670 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-18 12:57:30,672 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-18 12:57:30,673 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-18 12:57:30,674 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,675 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-18 12:57:30,676 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse18 (= |old(~a20~0)| ~a20~0)) (.cse19 (= |old(~a16~0)| ~a16~0))) (let ((.cse5 (not (= ~a8~0 13))) (.cse4 (= 13 |old(~a8~0)|)) (.cse15 (not (= 1 |old(~a17~0)|))) (.cse13 (not (= 5 |old(~a16~0)|))) (.cse8 (= ~a17~0 1)) (.cse16 (= 1 |old(~a7~0)|)) (.cse17 (not (= ~a7~0 1))) (.cse3 (= 15 ~a8~0)) (.cse9 (= ~a21~0 1)) (.cse10 (= ~a7~0 0)) (.cse14 (= |calculate_output_#in~input| 0)) (.cse6 (= 6 |old(~a16~0)|)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse0 (not (= 1 |old(~a20~0)|))) (.cse1 (not (= 15 |old(~a8~0)|))) (.cse20 (< 4 |old(~a16~0)|)) (.cse21 (and .cse18 .cse19)) (.cse2 (not (= 8 ~a12~0))) (.cse7 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse2 .cse5) (or .cse6 .cse1 .cse2 .cse3 .cse7) (or (and .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse1 (not (= 0 |old(~a20~0)|)) .cse13 .cse2) .cse14 .cse15) (or .cse16 .cse0 .cse2 .cse17) (or .cse12 .cse0 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 13 ~a8~0) (= 1 ~a21~0) (= 1 ~a17~0)) .cse2 (not .cse16) (not .cse4) .cse15) (or .cse6 (and .cse18 .cse19 .cse5) .cse4 .cse2 .cse7) (or .cse6 .cse16 .cse4 .cse2 .cse17 .cse7) (or .cse6 .cse11 .cse12 .cse0 .cse1 (and .cse9 .cse10) (= 0 |old(~a16~0)|) .cse2 .cse14) (or .cse16 .cse20 .cse17 .cse2 .cse7) (or .cse0 .cse21 .cse2) (or .cse11 .cse12 .cse2 .cse14 .cse15 .cse0 .cse1 .cse13 .cse8) (or .cse16 .cse1 .cse2 (and .cse17 .cse18 .cse19 .cse3) .cse7) (or (and .cse9 (= ~a17~0 0) .cse10) .cse14 (or (not .cse6) .cse11 .cse12 .cse0 .cse1 (not (= 0 |old(~a17~0)|)) .cse2)) (or .cse20 .cse21 .cse2 .cse7)))) [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-18 12:57:30,677 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-18 12:57:30,678 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-18 12:57:30,678 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-18 12:57:30,678 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-18 12:57:30,678 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-18 12:57:30,678 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-18 12:57:30,679 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-18 12:57:30,679 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 12:57:30,680 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-18 12:57:30,681 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L421 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-11-18 12:57:30,682 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:57:30,682 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (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-11-18 12:57:30,682 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-18 12:57:30,683 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (and .cse0 (<= ~a16~0 4)) (not (= 8 ~a12~0)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-18 12:57:30,683 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-18 12:57:30,683 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-18 12:57:30,683 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-18 12:57:30,683 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (and .cse0 (<= ~a16~0 4)) (not (= 8 ~a12~0)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-11-18 12:57:30,683 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-18 12:57:30,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:57:30 BoogieIcfgContainer [2018-11-18 12:57:30,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:57:30,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:57:30,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:57:30,707 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:57:30,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:56:58" (3/4) ... [2018-11-18 12:57:30,710 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 12:57:30,714 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 12:57:30,715 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 12:57:30,715 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 12:57:30,724 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 12:57:30,725 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 12:57:30,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0 == \old(a7)) || !(1 == \old(a21))) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && !(a8 == 13))) || (a20 <= 0 && a16 <= 4)) || !(8 == a12)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) [2018-11-18 12:57:30,826 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_125639db-84b6-4d7b-923f-b0d5c6d51d22/bin-2019/utaipan/witness.graphml [2018-11-18 12:57:30,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:57:30,827 INFO L168 Benchmark]: Toolchain (without parser) took 35751.90 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 911.7 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -94.5 MB). Peak memory consumption was 817.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,828 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:57:30,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 922.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 922.0 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,829 INFO L168 Benchmark]: Boogie Preprocessor took 133.47 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,829 INFO L168 Benchmark]: RCFGBuilder took 2415.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,829 INFO L168 Benchmark]: TraceAbstraction took 32272.79 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 809.0 MB). Free memory was 991.6 MB in the beginning and 1.1 GB in the end (delta: -80.2 MB). Peak memory consumption was 728.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,829 INFO L168 Benchmark]: Witness Printer took 120.46 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:57:30,834 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.20 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 922.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 177.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 922.0 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.47 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2415.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32272.79 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 809.0 MB). Free memory was 991.6 MB in the beginning and 1.1 GB in the end (delta: -80.2 MB). Peak memory consumption was 728.8 MB. Max. memory is 11.5 GB. * Witness Printer took 120.46 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 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: (((((((((!(0 == \old(a7)) || !(1 == \old(a21))) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && !(a8 == 13))) || (a20 <= 0 && a16 <= 4)) || !(8 == a12)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 32.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 22.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1386 SDtfs, 5210 SDslu, 1387 SDs, 0 SdLazy, 7141 SolverSat, 1165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1584 GetRequests, 1498 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4211occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975497877882603 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 29.39145299145299 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 170 PreInvPairs, 254 NumberOfFragments, 604 HoareAnnotationTreeSize, 170 FomulaSimplifications, 3148 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2173 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2239 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2685 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457172 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1246/1430 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...