./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29_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_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 14:08:53,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:08:53,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:08:53,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:08:53,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:08:53,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:08:53,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:08:53,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:08:53,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:08:53,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:08:53,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:08:53,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:08:53,538 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:08:53,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:08:53,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:08:53,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:08:53,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:08:53,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:08:53,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:08:53,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:08:53,547 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:08:53,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:08:53,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:08:53,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:08:53,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:08:53,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:08:53,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:08:53,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:08:53,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:08:53,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:08:53,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:08:53,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:08:53,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:08:53,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:08:53,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:08:53,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:08:53,557 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:08:53,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:08:53,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:08:53,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:08:53,569 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:08:53,569 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:08:53,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:08:53,569 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:08:53,569 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:08:53,569 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:08:53,570 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:08:53,570 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:08:53,570 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:08:53,570 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:08:53,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:08:53,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:08:53,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:08:53,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:08:53,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:08:53,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:08:53,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:08:53,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:08:53,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:08:53,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:08:53,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:08:53,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:08:53,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:08:53,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:08:53,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:08:53,574 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:08:53,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:08:53,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:08:53,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:08:53,574 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_139d90d7-e7e1-40f2-89f7-269a83626be9/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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2018-11-18 14:08:53,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:08:53,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:08:53,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:08:53,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:08:53,622 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:08:53,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-18 14:08:53,662 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/data/6e88dd28f/97e9b6b818984c2ca713c5f725e28a2f/FLAG3e2b1f17a [2018-11-18 14:08:54,066 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:08:54,067 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-18 14:08:54,091 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/data/6e88dd28f/97e9b6b818984c2ca713c5f725e28a2f/FLAG3e2b1f17a [2018-11-18 14:08:54,424 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/data/6e88dd28f/97e9b6b818984c2ca713c5f725e28a2f [2018-11-18 14:08:54,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:08:54,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:08:54,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:08:54,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:08:54,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:08:54,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351a929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54, skipping insertion in model container [2018-11-18 14:08:54,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:08:54,476 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:08:54,712 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:08:54,716 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:08:54,786 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:08:54,800 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:08:54,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54 WrapperNode [2018-11-18 14:08:54,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:08:54,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:08:54,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:08:54,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:08:54,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:08:54,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:08:54,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:08:54,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:08:54,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... [2018-11-18 14:08:54,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:08:54,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:08:54,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:08:54,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:08:54,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/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 14:08:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:08:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:08:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:08:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 14:08:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 14:08:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:08:54,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:08:54,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:08:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:08:55,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:08:55,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:08:55 BoogieIcfgContainer [2018-11-18 14:08:55,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:08:55,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:08:55,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:08:55,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:08:55,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:08:54" (1/3) ... [2018-11-18 14:08:55,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c3eb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:08:55, skipping insertion in model container [2018-11-18 14:08:55,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:08:54" (2/3) ... [2018-11-18 14:08:55,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c3eb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:08:55, skipping insertion in model container [2018-11-18 14:08:55,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:08:55" (3/3) ... [2018-11-18 14:08:55,837 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-11-18 14:08:55,847 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:08:55,853 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:08:55,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:08:55,899 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:08:55,899 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:08:55,899 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:08:55,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:08:55,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:08:55,900 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:08:55,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:08:55,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:08:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 14:08:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 14:08:55,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:55,934 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] [2018-11-18 14:08:55,937 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:55,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-11-18 14:08:55,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:55,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:55,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:56,289 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 14:08:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:08:56,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:56,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:08:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:08:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:08:56,311 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 14:08:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:08:56,862 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 14:08:56,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:08:56,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-18 14:08:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:08:56,874 INFO L225 Difference]: With dead ends: 550 [2018-11-18 14:08:56,874 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 14:08:56,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:08:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 14:08:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 14:08:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 14:08:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-18 14:08:56,919 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-11-18 14:08:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:08:56,920 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-18 14:08:56,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:08:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-18 14:08:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 14:08:56,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:56,924 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] [2018-11-18 14:08:56,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:56,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-11-18 14:08:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:56,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:57,031 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 14:08:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:57,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:08:57,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:57,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:08:57,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:08:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:08:57,033 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-18 14:08:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:08:57,664 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-18 14:08:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:08:57,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-18 14:08:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:08:57,669 INFO L225 Difference]: With dead ends: 888 [2018-11-18 14:08:57,669 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 14:08:57,673 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 14:08:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 14:08:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-18 14:08:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-18 14:08:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-18 14:08:57,698 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-11-18 14:08:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:08:57,698 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-18 14:08:57,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:08:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-18 14:08:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 14:08:57,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:57,701 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] [2018-11-18 14:08:57,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:57,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-11-18 14:08:57,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:57,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:57,900 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 14:08:57,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:57,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:08:57,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:57,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:08:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:08:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:08:57,901 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-18 14:08:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:08:58,410 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-18 14:08:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:08:58,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-18 14:08:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:08:58,414 INFO L225 Difference]: With dead ends: 1210 [2018-11-18 14:08:58,414 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 14:08:58,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:08:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 14:08:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-18 14:08:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-18 14:08:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-18 14:08:58,434 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-11-18 14:08:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:08:58,434 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-18 14:08:58,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:08:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-18 14:08:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 14:08:58,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:58,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:08:58,437 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:58,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-11-18 14:08:58,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:58,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:58,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:08:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:08:58,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:58,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:08:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:08:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:08:58,696 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-18 14:08:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:08:59,183 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-18 14:08:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:08:59,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-18 14:08:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:08:59,187 INFO L225 Difference]: With dead ends: 1204 [2018-11-18 14:08:59,187 INFO L226 Difference]: Without dead ends: 535 [2018-11-18 14:08:59,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:08:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-18 14:08:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-18 14:08:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-18 14:08:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-18 14:08:59,201 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-11-18 14:08:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:08:59,202 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-18 14:08:59,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:08:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-18 14:08:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 14:08:59,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:59,204 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:08:59,204 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:59,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-11-18 14:08:59,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:59,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:59,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:08:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:08:59,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:59,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:08:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:08:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:08:59,275 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-18 14:08:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:08:59,770 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-11-18 14:08:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:08:59,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-18 14:08:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:08:59,774 INFO L225 Difference]: With dead ends: 1522 [2018-11-18 14:08:59,774 INFO L226 Difference]: Without dead ends: 993 [2018-11-18 14:08:59,776 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 14:08:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-18 14:08:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-11-18 14:08:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-11-18 14:08:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-11-18 14:08:59,794 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-11-18 14:08:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:08:59,794 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-11-18 14:08:59,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:08:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-11-18 14:08:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 14:08:59,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:08:59,797 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-11-18 14:08:59,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:08:59,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:08:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-11-18 14:08:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:08:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:08:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:08:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:08:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:08:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:08:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:08:59,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:08:59,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:08:59,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:08:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:08:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:08:59,881 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-11-18 14:09:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:00,423 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-11-18 14:09:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:09:00,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-18 14:09:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:00,432 INFO L225 Difference]: With dead ends: 2917 [2018-11-18 14:09:00,433 INFO L226 Difference]: Without dead ends: 1930 [2018-11-18 14:09:00,435 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 14:09:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-18 14:09:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-11-18 14:09:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-18 14:09:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-11-18 14:09:00,471 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-11-18 14:09:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:00,471 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-11-18 14:09:00,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:09:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-11-18 14:09:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 14:09:00,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:00,476 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 14:09:00,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:00,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-11-18 14:09:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:00,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:00,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:09:00,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:00,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:00,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-11-18 14:09:00,596 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:00,627 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:00,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:00,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:09:00,971 INFO L272 AbstractInterpreter]: Visited 108 different actions 108 times. Never merged. Never widened. Performed 1472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-18 14:09:00,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:00,979 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:09:01,280 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.27% of their original sizes. [2018-11-18 14:09:01,280 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:09:01,319 INFO L415 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2018-11-18 14:09:01,319 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:09:01,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:01,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-18 14:09:01,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:01,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:09:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:09:01,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:09:01,321 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 6 states. [2018-11-18 14:09:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:02,655 INFO L93 Difference]: Finished difference Result 3882 states and 5210 transitions. [2018-11-18 14:09:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:09:02,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-18 14:09:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:02,660 INFO L225 Difference]: With dead ends: 3882 [2018-11-18 14:09:02,660 INFO L226 Difference]: Without dead ends: 2013 [2018-11-18 14:09:02,663 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:09:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-11-18 14:09:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 2011. [2018-11-18 14:09:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-11-18 14:09:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2667 transitions. [2018-11-18 14:09:02,691 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2667 transitions. Word has length 142 [2018-11-18 14:09:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:02,691 INFO L480 AbstractCegarLoop]: Abstraction has 2011 states and 2667 transitions. [2018-11-18 14:09:02,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:09:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2667 transitions. [2018-11-18 14:09:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 14:09:02,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:02,694 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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] [2018-11-18 14:09:02,694 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:02,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-11-18 14:09:02,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:02,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:09:02,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:02,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:02,754 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-11-18 14:09:02,755 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:02,758 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:02,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:02,923 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:09:02,923 INFO L272 AbstractInterpreter]: Visited 112 different actions 218 times. Merged at 5 different actions 5 times. Never widened. Performed 2920 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2920 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 14:09:02,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:02,931 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:09:03,086 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 81.74% of their original sizes. [2018-11-18 14:09:03,086 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:09:03,148 INFO L415 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2018-11-18 14:09:03,148 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:09:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:03,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:09:03,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:09:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:09:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:09:03,149 INFO L87 Difference]: Start difference. First operand 2011 states and 2667 transitions. Second operand 10 states. [2018-11-18 14:09:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:05,508 INFO L93 Difference]: Finished difference Result 4021 states and 5371 transitions. [2018-11-18 14:09:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:09:05,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-11-18 14:09:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:05,513 INFO L225 Difference]: With dead ends: 4021 [2018-11-18 14:09:05,513 INFO L226 Difference]: Without dead ends: 2152 [2018-11-18 14:09:05,515 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:09:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-11-18 14:09:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2149. [2018-11-18 14:09:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2149 states. [2018-11-18 14:09:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2815 transitions. [2018-11-18 14:09:05,544 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2815 transitions. Word has length 144 [2018-11-18 14:09:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:05,545 INFO L480 AbstractCegarLoop]: Abstraction has 2149 states and 2815 transitions. [2018-11-18 14:09:05,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:09:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2815 transitions. [2018-11-18 14:09:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 14:09:05,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:05,548 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 14:09:05,549 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:05,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1984849738, now seen corresponding path program 1 times [2018-11-18 14:09:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:05,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:09:05,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:05,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:05,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-18 14:09:05,666 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:05,669 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:05,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:05,847 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:09:05,847 INFO L272 AbstractInterpreter]: Visited 112 different actions 328 times. Merged at 7 different actions 14 times. Never widened. Performed 4579 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4579 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 14:09:05,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:05,859 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:09:06,014 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 83.5% of their original sizes. [2018-11-18 14:09:06,014 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:09:06,076 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-18 14:09:06,076 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:09:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-18 14:09:06,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:06,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:09:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:09:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:09:06,077 INFO L87 Difference]: Start difference. First operand 2149 states and 2815 transitions. Second operand 9 states. [2018-11-18 14:09:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:08,071 INFO L93 Difference]: Finished difference Result 4854 states and 6453 transitions. [2018-11-18 14:09:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:09:08,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2018-11-18 14:09:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:08,081 INFO L225 Difference]: With dead ends: 4854 [2018-11-18 14:09:08,081 INFO L226 Difference]: Without dead ends: 2985 [2018-11-18 14:09:08,087 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:09:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2018-11-18 14:09:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2976. [2018-11-18 14:09:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2018-11-18 14:09:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3815 transitions. [2018-11-18 14:09:08,145 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3815 transitions. Word has length 184 [2018-11-18 14:09:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:08,146 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 3815 transitions. [2018-11-18 14:09:08,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:09:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3815 transitions. [2018-11-18 14:09:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-18 14:09:08,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:08,153 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, 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] [2018-11-18 14:09:08,153 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:08,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1644608177, now seen corresponding path program 1 times [2018-11-18 14:09:08,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:08,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:08,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 14:09:08,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:08,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:08,287 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-18 14:09:08,287 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:08,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:08,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:08,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:09:08,526 INFO L272 AbstractInterpreter]: Visited 113 different actions 220 times. Merged at 5 different actions 5 times. Never widened. Performed 2981 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2981 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 14:09:08,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:08,543 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:09:08,748 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 81.69% of their original sizes. [2018-11-18 14:09:08,748 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:09:08,845 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-18 14:09:08,845 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:09:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:09:08,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:08,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:09:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:09:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:09:08,846 INFO L87 Difference]: Start difference. First operand 2976 states and 3815 transitions. Second operand 10 states. [2018-11-18 14:09:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:11,010 INFO L93 Difference]: Finished difference Result 6090 states and 7820 transitions. [2018-11-18 14:09:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 14:09:11,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 192 [2018-11-18 14:09:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:11,018 INFO L225 Difference]: With dead ends: 6090 [2018-11-18 14:09:11,018 INFO L226 Difference]: Without dead ends: 3394 [2018-11-18 14:09:11,021 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:09:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2018-11-18 14:09:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3391. [2018-11-18 14:09:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3391 states. [2018-11-18 14:09:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4268 transitions. [2018-11-18 14:09:11,064 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4268 transitions. Word has length 192 [2018-11-18 14:09:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:11,064 INFO L480 AbstractCegarLoop]: Abstraction has 3391 states and 4268 transitions. [2018-11-18 14:09:11,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:09:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4268 transitions. [2018-11-18 14:09:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-18 14:09:11,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:11,069 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, 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] [2018-11-18 14:09:11,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:11,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash -199400556, now seen corresponding path program 1 times [2018-11-18 14:09:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:11,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 14:09:11,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:11,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:11,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-18 14:09:11,165 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], [73], [74], [78], [82], [86], [90], [94], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:11,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:11,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:11,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:09:11,415 INFO L272 AbstractInterpreter]: Visited 115 different actions 462 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Performed 6565 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6565 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 14:09:11,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:11,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:09:11,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:11,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/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 14:09:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:11,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:09:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:11,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:09:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 14:09:11,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:09:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:09:11,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:09:11,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 14:09:11,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:09:11,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:09:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:09:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:09:11,703 INFO L87 Difference]: Start difference. First operand 3391 states and 4268 transitions. Second operand 11 states. [2018-11-18 14:09:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:12,754 INFO L93 Difference]: Finished difference Result 7399 states and 9471 transitions. [2018-11-18 14:09:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:09:12,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2018-11-18 14:09:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:12,766 INFO L225 Difference]: With dead ends: 7399 [2018-11-18 14:09:12,767 INFO L226 Difference]: Without dead ends: 4565 [2018-11-18 14:09:12,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:09:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2018-11-18 14:09:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 4549. [2018-11-18 14:09:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-11-18 14:09:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 5600 transitions. [2018-11-18 14:09:12,854 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 5600 transitions. Word has length 201 [2018-11-18 14:09:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:12,854 INFO L480 AbstractCegarLoop]: Abstraction has 4549 states and 5600 transitions. [2018-11-18 14:09:12,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:09:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 5600 transitions. [2018-11-18 14:09:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-18 14:09:12,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:12,863 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, 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] [2018-11-18 14:09:12,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:12,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1715987142, now seen corresponding path program 2 times [2018-11-18 14:09:12,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:12,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:12,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:12,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:09:12,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:12,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:12,992 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:09:12,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:09:12,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:12,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/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 14:09:13,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:09:13,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:09:13,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 14:09:13,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:09:13,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:09:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 14:09:13,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:09:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 14:09:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 14:09:13,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:09:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:09:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:09:13,223 INFO L87 Difference]: Start difference. First operand 4549 states and 5600 transitions. Second operand 3 states. [2018-11-18 14:09:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:13,636 INFO L93 Difference]: Finished difference Result 11399 states and 14395 transitions. [2018-11-18 14:09:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:09:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-11-18 14:09:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:13,651 INFO L225 Difference]: With dead ends: 11399 [2018-11-18 14:09:13,651 INFO L226 Difference]: Without dead ends: 7130 [2018-11-18 14:09:13,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:09:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2018-11-18 14:09:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7048. [2018-11-18 14:09:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2018-11-18 14:09:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 8635 transitions. [2018-11-18 14:09:13,738 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 8635 transitions. Word has length 201 [2018-11-18 14:09:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:13,739 INFO L480 AbstractCegarLoop]: Abstraction has 7048 states and 8635 transitions. [2018-11-18 14:09:13,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:09:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 8635 transitions. [2018-11-18 14:09:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 14:09:13,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:13,745 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, 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] [2018-11-18 14:09:13,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:13,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -332665990, now seen corresponding path program 1 times [2018-11-18 14:09:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:13,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:09:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:13,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 14:09:13,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:13,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:13,854 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-18 14:09:13,854 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], [173], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:13,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:13,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:14,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:09:14,017 INFO L272 AbstractInterpreter]: Visited 114 different actions 334 times. Merged at 7 different actions 14 times. Never widened. Performed 4427 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 14:09:14,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:14,018 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:09:14,272 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 83.47% of their original sizes. [2018-11-18 14:09:14,272 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:09:14,350 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-18 14:09:14,350 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:09:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:09:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 14:09:14,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:09:14,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:09:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:09:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:09:14,351 INFO L87 Difference]: Start difference. First operand 7048 states and 8635 transitions. Second operand 9 states. [2018-11-18 14:09:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:16,132 INFO L93 Difference]: Finished difference Result 13820 states and 17031 transitions. [2018-11-18 14:09:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:09:16,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2018-11-18 14:09:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:16,151 INFO L225 Difference]: With dead ends: 13820 [2018-11-18 14:09:16,151 INFO L226 Difference]: Without dead ends: 7466 [2018-11-18 14:09:16,161 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:09:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-18 14:09:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7460. [2018-11-18 14:09:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7460 states. [2018-11-18 14:09:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 9086 transitions. [2018-11-18 14:09:16,258 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 9086 transitions. Word has length 216 [2018-11-18 14:09:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:16,258 INFO L480 AbstractCegarLoop]: Abstraction has 7460 states and 9086 transitions. [2018-11-18 14:09:16,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:09:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 9086 transitions. [2018-11-18 14:09:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-18 14:09:16,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:09:16,266 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-18 14:09:16,267 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:09:16,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1371913748, now seen corresponding path program 1 times [2018-11-18 14:09:16,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:09:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:16,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:09:16,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:09:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:09:16,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:16,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:09:16,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-18 14:09:16,380 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], [105], [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], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:09:16,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:09:16,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:09:16,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:09:16,722 INFO L272 AbstractInterpreter]: Visited 115 different actions 456 times. Merged at 9 different actions 32 times. Never widened. Performed 6604 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6604 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 14:09:16,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:09:16,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:09:16,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:09:16,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:09:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:09:16,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:09:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:09:16,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:09:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 14:09:16,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:09:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 14:09:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:09:16,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-18 14:09:16,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:09:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:09:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:09:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:09:16,967 INFO L87 Difference]: Start difference. First operand 7460 states and 9086 transitions. Second operand 11 states. [2018-11-18 14:09:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:09:18,895 INFO L93 Difference]: Finished difference Result 15309 states and 21415 transitions. [2018-11-18 14:09:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 14:09:18,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-11-18 14:09:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:09:18,896 INFO L225 Difference]: With dead ends: 15309 [2018-11-18 14:09:18,896 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:09:18,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 14:09:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:09:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:09:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:09:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:09:18,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2018-11-18 14:09:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:09:18,928 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:09:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:09:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:09:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:09:18,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:09:19,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,699 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 202 [2018-11-18 14:09:19,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:19,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:09:20,183 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 189 [2018-11-18 14:09:21,205 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 103 [2018-11-18 14:09:21,770 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 65 [2018-11-18 14:09:22,317 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 65 [2018-11-18 14:09:22,318 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:09:22,318 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-18 14:09:22,318 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:09:22,318 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-18 14:09:22,319 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,320 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-18 14:09:22,321 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-18 14:09:22,322 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 14:09:22,323 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-18 14:09:22,324 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,325 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-18 14:09:22,326 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,327 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-18 14:09:22,328 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 13 |old(~a8~0)|)) (.cse22 (= 4 |old(~a16~0)|)) (.cse27 (= ~a16~0 |old(~a16~0)|)) (.cse24 (= ~a7~0 |old(~a7~0)|)) (.cse25 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a20~0)| ~a20~0)) (.cse26 (<= ~a21~0 |old(~a21~0)|)) (.cse30 (= |old(~a16~0)| ~a16~0)) (.cse4 (<= ~a17~0 0))) (let ((.cse9 (= ~a17~0 1)) (.cse13 (not (= 5 |old(~a16~0)|))) (.cse14 (and .cse24 .cse25 .cse23 .cse26 .cse30 .cse4)) (.cse17 (= 0 |old(~a16~0)|)) (.cse6 (not (= 0 |old(~a7~0)|))) (.cse8 (= |calculate_output_#in~input| 0)) (.cse12 (not (= 15 |old(~a8~0)|))) (.cse16 (= ~a21~0 1)) (.cse20 (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse27)) (.cse7 (not (= 1 |old(~a21~0)|))) (.cse21 (not .cse22)) (.cse28 (= 1 ~a20~0)) (.cse29 (= 13 ~a8~0)) (.cse31 (= 1 ~a21~0)) (.cse32 (= 1 ~a17~0)) (.cse33 (not .cse1)) (.cse10 (not (= 1 |old(~a17~0)|))) (.cse0 (= 1 |old(~a7~0)|)) (.cse11 (not (= 1 |old(~a20~0)|))) (.cse3 (< 0 |old(~a17~0)|)) (.cse19 (= 6 |old(~a16~0)|)) (.cse2 (not (= 8 ~a12~0))) (.cse15 (< 0 |old(~a21~0)|)) (.cse5 (< 0 |old(~a20~0)|)) (.cse18 (and .cse24 .cse25 .cse23 .cse26 .cse30))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse11 .cse14 .cse2 .cse3 .cse15) (or .cse6 .cse7 .cse12 .cse16 .cse17 .cse2 .cse8 .cse5) (or .cse0 .cse18 .cse1 .cse2 .cse5) (or .cse8 .cse9 (or .cse6 .cse7 .cse12 (not (= 0 |old(~a20~0)|)) .cse13 .cse2 .cse10)) (or .cse19 .cse1 .cse14 .cse2 .cse3 .cse5) (or .cse0 .cse20 .cse11 .cse21 .cse2 .cse3) (or .cse8 (or (not .cse19) .cse6 .cse7 .cse11 .cse12 (not (= 0 |old(~a17~0)|)) .cse2) (= ~a17~0 0)) (or .cse19 .cse11 .cse2 .cse18 .cse15) (or .cse6 .cse7 .cse22 .cse11 .cse12 .cse17 .cse2 .cse8 .cse16) (or .cse0 .cse11 (and .cse23 .cse24 .cse25 .cse26 .cse27) .cse1 .cse2) (or .cse6 .cse7 .cse21 .cse2 .cse3 .cse8 .cse11 .cse12 .cse16) (or .cse0 .cse4 .cse21 .cse2 .cse3 .cse5) (or .cse19 .cse22 .cse11 .cse1 .cse20 .cse2 .cse3) (or .cse7 .cse11 .cse21 (and (= 1 ~a7~0) .cse28 .cse29 .cse30 .cse31 .cse32) .cse2 (not .cse0) .cse33 .cse10) (or .cse0 .cse21 .cse2 .cse18 .cse5) (or .cse18 .cse0 .cse22 .cse11 .cse2) (or .cse7 .cse0 .cse11 .cse21 .cse2 (and (not (= ~a7~0 1)) .cse28 .cse29 .cse30 .cse31 .cse32) .cse33 .cse10) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4) (or .cse19 .cse2 .cse15 .cse5 .cse18)))) [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-18 14:09:22,329 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,330 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-18 14:09:22,331 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:09:22,331 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)|)) (and (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|))) [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 8 ~a12~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (and .cse5 .cse3 .cse6) (and .cse0 .cse8 .cse9) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-18 14:09:22,331 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-18 14:09:22,332 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 8 ~a12~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (and .cse5 .cse3 .cse6) (and .cse0 .cse8 .cse9) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-11-18 14:09:22,332 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-18 14:09:22,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:09:22 BoogieIcfgContainer [2018-11-18 14:09:22,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:09:22,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:09:22,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:09:22,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:09:22,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:08:55" (3/4) ... [2018-11-18 14:09:22,346 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:09:22,351 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:09:22,351 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 14:09:22,351 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:09:22,360 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 14:09:22,361 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 14:09:22,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(1 == \old(a20)) || !(5 == \old(a16))) || ((!(a7 == 1) && a16 == 4) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(1 == \old(a21))) || ((!(a7 == 1) && !(a8 == 13)) && a20 <= 0)) || !(8 == a12)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 1 == a20) && !(a8 == 13))) || ((!(a7 == 1) && 1 == a20) && a17 <= 0)) || (((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4))) || ((a21 <= 0 && \old(a20) == a20) && a17 <= 0)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((1 == a20 && !(a16 == 6)) && !(a8 == 13)) && !(a16 == 4)) && a17 <= 0) [2018-11-18 14:09:22,440 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_139d90d7-e7e1-40f2-89f7-269a83626be9/bin-2019/utaipan/witness.graphml [2018-11-18 14:09:22,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:09:22,441 INFO L168 Benchmark]: Toolchain (without parser) took 28014.01 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 958.1 MB in the beginning and 956.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,441 INFO L168 Benchmark]: CDTParser took 0.18 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 14:09:22,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.50 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 920.5 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 920.5 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,442 INFO L168 Benchmark]: Boogie Preprocessor took 55.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,442 INFO L168 Benchmark]: RCFGBuilder took 886.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,442 INFO L168 Benchmark]: TraceAbstraction took 26510.71 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 984.2 MB in the end (delta: 57.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,442 INFO L168 Benchmark]: Witness Printer took 97.92 ms. Allocated memory is still 2.4 GB. Free memory was 984.2 MB in the beginning and 956.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:09:22,444 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.18 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 372.50 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 920.5 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 920.5 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 886.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26510.71 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 984.2 MB in the end (delta: 57.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 97.92 ms. Allocated memory is still 2.4 GB. Free memory was 984.2 MB in the beginning and 956.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == \old(a20)) || !(5 == \old(a16))) || ((!(a7 == 1) && a16 == 4) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(1 == \old(a21))) || ((!(a7 == 1) && !(a8 == 13)) && a20 <= 0)) || !(8 == a12)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 1 == a20) && !(a8 == 13))) || ((!(a7 == 1) && 1 == a20) && a17 <= 0)) || (((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4))) || ((a21 <= 0 && \old(a20) == a20) && a17 <= 0)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((1 == a20 && !(a16 == 6)) && !(a8 == 13)) && !(a16 == 4)) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 26.4s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1891 SDtfs, 9897 SDslu, 2206 SDs, 0 SdLazy, 12384 SolverSat, 1904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2305 GetRequests, 2138 SyntacticMatches, 17 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7460occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9973041032875223 AbsIntWeakeningRatio, 0.21420389461626574 AbsIntAvgWeakeningVarsNumRemoved, 28.813287514318443 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 427 PreInvPairs, 873 NumberOfFragments, 1139 HoareAnnotationTreeSize, 427 FomulaSimplifications, 20054 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18378 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1993410 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1991/2329 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...