./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/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 bab2da56573ef206e3542dbf4ea35e0da738901e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:32:40,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:32:40,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:32:40,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:32:40,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:32:40,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:32:40,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:32:40,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:32:40,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:32:40,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:32:40,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:32:40,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:32:40,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:32:40,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:32:40,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:32:40,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:32:40,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:32:40,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:32:40,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:32:40,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:32:40,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:32:40,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:32:40,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:32:40,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:32:40,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:32:40,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:32:40,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:32:40,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:32:40,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:32:40,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:32:40,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:32:40,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:32:40,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:32:40,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:32:40,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:32:40,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:32:40,772 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:32:40,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:32:40,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:32:40,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:32:40,780 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:32:40,780 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:32:40,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:32:40,780 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:32:40,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:32:40,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:32:40,781 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:32:40,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:32:40,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:32:40,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:32:40,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:32:40,783 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_543c1ea4-6815-4400-a5ed-1109d39aa4bf/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 -> bab2da56573ef206e3542dbf4ea35e0da738901e [2018-12-02 20:32:40,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:32:40,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:32:40,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:32:40,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:32:40,812 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:32:40,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-12-02 20:32:40,846 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/data/4d5a4433b/f4515c8d932844b583c1ebc8104812c7/FLAGcad695328 [2018-12-02 20:32:41,313 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:32:41,313 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-12-02 20:32:41,320 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/data/4d5a4433b/f4515c8d932844b583c1ebc8104812c7/FLAGcad695328 [2018-12-02 20:32:41,330 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/data/4d5a4433b/f4515c8d932844b583c1ebc8104812c7 [2018-12-02 20:32:41,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:32:41,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:32:41,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:32:41,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:32:41,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:32:41,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41, skipping insertion in model container [2018-12-02 20:32:41,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:32:41,368 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:32:41,556 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:32:41,559 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:32:41,657 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:32:41,670 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:32:41,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41 WrapperNode [2018-12-02 20:32:41,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:32:41,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:32:41,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:32:41,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:32:41,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:32:41,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:32:41,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:32:41,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:32:41,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2018-12-02 20:32:41,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:32:41,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:32:41,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:32:41,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:32:41,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:32:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:32:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:32:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 20:32:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 20:32:41,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:32:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:32:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:32:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:32:42,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:32:42,378 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 20:32:42,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42 BoogieIcfgContainer [2018-12-02 20:32:42,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:32:42,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:32:42,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:32:42,380 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:32:42,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:32:41" (1/3) ... [2018-12-02 20:32:42,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:42, skipping insertion in model container [2018-12-02 20:32:42,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (2/3) ... [2018-12-02 20:32:42,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:42, skipping insertion in model container [2018-12-02 20:32:42,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42" (3/3) ... [2018-12-02 20:32:42,383 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-12-02 20:32:42,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:32:42,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:32:42,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:32:42,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:32:42,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:32:42,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:32:42,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:32:42,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:32:42,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:32:42,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:32:42,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:32:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-02 20:32:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 20:32:42,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:42,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:42,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:42,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 597031182, now seen corresponding path program 1 times [2018-12-02 20:32:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:42,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:42,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:42,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:32:42,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:42,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:32:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:32:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:32:42,719 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-02 20:32:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:43,159 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-02 20:32:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:32:43,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-02 20:32:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:43,170 INFO L225 Difference]: With dead ends: 547 [2018-12-02 20:32:43,170 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 20:32:43,173 INFO L631 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-12-02 20:32:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 20:32:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-02 20:32:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 20:32:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2018-12-02 20:32:43,215 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 120 [2018-12-02 20:32:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:43,216 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2018-12-02 20:32:43,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:32:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-12-02 20:32:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 20:32:43,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:43,219 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:43,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:43,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 330455461, now seen corresponding path program 1 times [2018-12-02 20:32:43,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:43,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:43,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:43,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:43,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:43,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:32:43,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:43,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:32:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:32:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:43,316 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 6 states. [2018-12-02 20:32:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:43,693 INFO L93 Difference]: Finished difference Result 703 states and 1026 transitions. [2018-12-02 20:32:43,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:32:43,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-12-02 20:32:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:43,696 INFO L225 Difference]: With dead ends: 703 [2018-12-02 20:32:43,696 INFO L226 Difference]: Without dead ends: 431 [2018-12-02 20:32:43,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-02 20:32:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2018-12-02 20:32:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 20:32:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2018-12-02 20:32:43,712 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 130 [2018-12-02 20:32:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:43,712 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2018-12-02 20:32:43,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:32:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2018-12-02 20:32:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 20:32:43,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:43,714 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:43,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:43,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:43,715 INFO L82 PathProgramCache]: Analyzing trace with hash -46995225, now seen corresponding path program 1 times [2018-12-02 20:32:43,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:43,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:43,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:43,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:43,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:32:43,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:43,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:32:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:32:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:43,889 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 5 states. [2018-12-02 20:32:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:44,184 INFO L93 Difference]: Finished difference Result 933 states and 1337 transitions. [2018-12-02 20:32:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:32:44,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2018-12-02 20:32:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:44,186 INFO L225 Difference]: With dead ends: 933 [2018-12-02 20:32:44,187 INFO L226 Difference]: Without dead ends: 417 [2018-12-02 20:32:44,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-02 20:32:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-02 20:32:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 20:32:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 550 transitions. [2018-12-02 20:32:44,203 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 550 transitions. Word has length 131 [2018-12-02 20:32:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:44,204 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 550 transitions. [2018-12-02 20:32:44,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:32:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 550 transitions. [2018-12-02 20:32:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 20:32:44,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:44,205 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:44,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1746951265, now seen corresponding path program 1 times [2018-12-02 20:32:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:44,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:44,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:44,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:44,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:32:44,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:44,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:32:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:32:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:44,407 INFO L87 Difference]: Start difference. First operand 417 states and 550 transitions. Second operand 5 states. [2018-12-02 20:32:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:44,696 INFO L93 Difference]: Finished difference Result 912 states and 1228 transitions. [2018-12-02 20:32:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:32:44,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-02 20:32:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:44,698 INFO L225 Difference]: With dead ends: 912 [2018-12-02 20:32:44,698 INFO L226 Difference]: Without dead ends: 417 [2018-12-02 20:32:44,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-02 20:32:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-02 20:32:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 20:32:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-02 20:32:44,708 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 132 [2018-12-02 20:32:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:44,708 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-02 20:32:44,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:32:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-02 20:32:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 20:32:44,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:44,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:44,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:44,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1219225115, now seen corresponding path program 1 times [2018-12-02 20:32:44,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:44,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:44,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:44,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:44,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:32:44,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:44,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:32:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:32:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:32:44,792 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 3 states. [2018-12-02 20:32:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:45,049 INFO L93 Difference]: Finished difference Result 1237 states and 1661 transitions. [2018-12-02 20:32:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:32:45,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-02 20:32:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:45,053 INFO L225 Difference]: With dead ends: 1237 [2018-12-02 20:32:45,053 INFO L226 Difference]: Without dead ends: 826 [2018-12-02 20:32:45,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:32:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-02 20:32:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2018-12-02 20:32:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2018-12-02 20:32:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1069 transitions. [2018-12-02 20:32:45,073 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1069 transitions. Word has length 137 [2018-12-02 20:32:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:45,073 INFO L480 AbstractCegarLoop]: Abstraction has 826 states and 1069 transitions. [2018-12-02 20:32:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:32:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1069 transitions. [2018-12-02 20:32:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 20:32:45,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:45,076 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:45,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:45,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1710204053, now seen corresponding path program 1 times [2018-12-02 20:32:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:45,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:45,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:45,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:45,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:32:45,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:45,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:32:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:32:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:45,128 INFO L87 Difference]: Start difference. First operand 826 states and 1069 transitions. Second operand 6 states. [2018-12-02 20:32:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:45,503 INFO L93 Difference]: Finished difference Result 2375 states and 3230 transitions. [2018-12-02 20:32:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:32:45,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-12-02 20:32:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:45,507 INFO L225 Difference]: With dead ends: 2375 [2018-12-02 20:32:45,508 INFO L226 Difference]: Without dead ends: 1555 [2018-12-02 20:32:45,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-12-02 20:32:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1531. [2018-12-02 20:32:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2018-12-02 20:32:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1928 transitions. [2018-12-02 20:32:45,538 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1928 transitions. Word has length 138 [2018-12-02 20:32:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:45,538 INFO L480 AbstractCegarLoop]: Abstraction has 1531 states and 1928 transitions. [2018-12-02 20:32:45,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:32:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1928 transitions. [2018-12-02 20:32:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 20:32:45,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:45,540 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:45,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:45,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2034569339, now seen corresponding path program 1 times [2018-12-02 20:32:45,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:45,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:45,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 20:32:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:45,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:45,617 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-12-02 20:32:45,618 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:45,644 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:45,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:45,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:32:45,946 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 1602 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-02 20:32:45,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:45,951 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:32:46,189 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 80.47% of their original sizes. [2018-12-02 20:32:46,189 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:32:46,206 INFO L418 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2018-12-02 20:32:46,206 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:32:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:32:46,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-12-02 20:32:46,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:46,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:32:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:32:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:46,208 INFO L87 Difference]: Start difference. First operand 1531 states and 1928 transitions. Second operand 6 states. [2018-12-02 20:32:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:47,584 INFO L93 Difference]: Finished difference Result 3192 states and 4018 transitions. [2018-12-02 20:32:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:32:47,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-12-02 20:32:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:47,590 INFO L225 Difference]: With dead ends: 3192 [2018-12-02 20:32:47,590 INFO L226 Difference]: Without dead ends: 1667 [2018-12-02 20:32:47,593 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:32:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-02 20:32:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1666. [2018-12-02 20:32:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2018-12-02 20:32:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2069 transitions. [2018-12-02 20:32:47,634 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2069 transitions. Word has length 146 [2018-12-02 20:32:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:47,635 INFO L480 AbstractCegarLoop]: Abstraction has 1666 states and 2069 transitions. [2018-12-02 20:32:47,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:32:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2069 transitions. [2018-12-02 20:32:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 20:32:47,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:47,639 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:47,639 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:47,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2025242208, now seen corresponding path program 1 times [2018-12-02 20:32:47,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:47,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:47,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:47,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:47,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:47,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:47,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:47,701 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-12-02 20:32:47,701 INFO L205 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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:47,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:47,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:47,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:32:47,899 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 4 different actions 4 times. Never widened. Performed 3208 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-02 20:32:47,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:47,901 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:32:48,084 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 81.93% of their original sizes. [2018-12-02 20:32:48,084 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:32:48,140 INFO L418 sIntCurrentIteration]: We unified 153 AI predicates to 153 [2018-12-02 20:32:48,140 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:32:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:32:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 20:32:48,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:48,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:32:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:32:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:32:48,141 INFO L87 Difference]: Start difference. First operand 1666 states and 2069 transitions. Second operand 10 states. [2018-12-02 20:32:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:49,862 INFO L93 Difference]: Finished difference Result 3330 states and 4162 transitions. [2018-12-02 20:32:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:32:49,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-12-02 20:32:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:49,867 INFO L225 Difference]: With dead ends: 3330 [2018-12-02 20:32:49,868 INFO L226 Difference]: Without dead ends: 1805 [2018-12-02 20:32:49,870 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:32:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-12-02 20:32:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2018-12-02 20:32:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-02 20:32:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2216 transitions. [2018-12-02 20:32:49,903 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2216 transitions. Word has length 154 [2018-12-02 20:32:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:49,903 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2216 transitions. [2018-12-02 20:32:49,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:32:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2216 transitions. [2018-12-02 20:32:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 20:32:49,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:49,906 INFO L402 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, 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] [2018-12-02 20:32:49,906 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -495827166, now seen corresponding path program 1 times [2018-12-02 20:32:49,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:49,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:49,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:49,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:49,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:49,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:49,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:49,969 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-02 20:32:49,969 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [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], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:49,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:49,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:50,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:32:50,108 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 4 different actions 4 times. Never widened. Performed 3261 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3261 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-02 20:32:50,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:50,109 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:32:50,256 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 81.87% of their original sizes. [2018-12-02 20:32:50,256 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:32:50,300 INFO L418 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2018-12-02 20:32:50,300 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:32:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:32:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 20:32:50,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:32:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:32:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:32:50,301 INFO L87 Difference]: Start difference. First operand 1803 states and 2216 transitions. Second operand 10 states. [2018-12-02 20:32:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:51,979 INFO L93 Difference]: Finished difference Result 3741 states and 4629 transitions. [2018-12-02 20:32:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 20:32:51,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-12-02 20:32:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:51,984 INFO L225 Difference]: With dead ends: 3741 [2018-12-02 20:32:51,984 INFO L226 Difference]: Without dead ends: 2216 [2018-12-02 20:32:51,986 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:32:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2018-12-02 20:32:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2214. [2018-12-02 20:32:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2018-12-02 20:32:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2649 transitions. [2018-12-02 20:32:52,016 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2649 transitions. Word has length 187 [2018-12-02 20:32:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:52,016 INFO L480 AbstractCegarLoop]: Abstraction has 2214 states and 2649 transitions. [2018-12-02 20:32:52,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:32:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2649 transitions. [2018-12-02 20:32:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 20:32:52,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:52,019 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2018-12-02 20:32:52,020 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:52,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1940598937, now seen corresponding path program 1 times [2018-12-02 20:32:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:52,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:52,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 20:32:52,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:52,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:52,089 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-02 20:32:52,089 INFO L205 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], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:52,092 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:52,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:52,304 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:32:52,304 INFO L272 AbstractInterpreter]: Visited 125 different actions 375 times. Merged at 7 different actions 20 times. Never widened. Performed 5054 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5054 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 20:32:52,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:52,306 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:32:52,439 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 83.61% of their original sizes. [2018-12-02 20:32:52,439 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:32:52,469 INFO L418 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-12-02 20:32:52,469 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:32:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:32:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-12-02 20:32:52,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:52,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:32:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:32:52,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:52,470 INFO L87 Difference]: Start difference. First operand 2214 states and 2649 transitions. Second operand 9 states. [2018-12-02 20:32:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:54,622 INFO L93 Difference]: Finished difference Result 3055 states and 3661 transitions. [2018-12-02 20:32:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 20:32:54,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-12-02 20:32:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:54,633 INFO L225 Difference]: With dead ends: 3055 [2018-12-02 20:32:54,633 INFO L226 Difference]: Without dead ends: 3053 [2018-12-02 20:32:54,634 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-02 20:32:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2018-12-02 20:32:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3040. [2018-12-02 20:32:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2018-12-02 20:32:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3646 transitions. [2018-12-02 20:32:54,681 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3646 transitions. Word has length 195 [2018-12-02 20:32:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:54,681 INFO L480 AbstractCegarLoop]: Abstraction has 3040 states and 3646 transitions. [2018-12-02 20:32:54,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:32:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3646 transitions. [2018-12-02 20:32:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-02 20:32:54,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:54,685 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-12-02 20:32:54,685 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:54,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:54,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1302735996, now seen corresponding path program 1 times [2018-12-02 20:32:54,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:54,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:54,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:54,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:54,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 20:32:54,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:54,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:54,789 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-12-02 20:32:54,790 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:54,792 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:54,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:55,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:32:55,059 INFO L272 AbstractInterpreter]: Visited 127 different actions 505 times. Merged at 8 different actions 30 times. Never widened. Performed 7097 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7097 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-02 20:32:55,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:55,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:32:55,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:55,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:55,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:55,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:32:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:55,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 20:32:55,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:32:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 20:32:55,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:32:55,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 20:32:55,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:32:55,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:32:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:32:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:32:55,272 INFO L87 Difference]: Start difference. First operand 3040 states and 3646 transitions. Second operand 11 states. [2018-12-02 20:32:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:56,375 INFO L93 Difference]: Finished difference Result 8866 states and 11039 transitions. [2018-12-02 20:32:56,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 20:32:56,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-12-02 20:32:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:56,387 INFO L225 Difference]: With dead ends: 8866 [2018-12-02 20:32:56,387 INFO L226 Difference]: Without dead ends: 6378 [2018-12-02 20:32:56,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-12-02 20:32:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2018-12-02 20:32:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 6372. [2018-12-02 20:32:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6372 states. [2018-12-02 20:32:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6372 states to 6372 states and 7694 transitions. [2018-12-02 20:32:56,482 INFO L78 Accepts]: Start accepts. Automaton has 6372 states and 7694 transitions. Word has length 202 [2018-12-02 20:32:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:56,482 INFO L480 AbstractCegarLoop]: Abstraction has 6372 states and 7694 transitions. [2018-12-02 20:32:56,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:32:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6372 states and 7694 transitions. [2018-12-02 20:32:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 20:32:56,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:56,490 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2018-12-02 20:32:56,490 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1598439036, now seen corresponding path program 1 times [2018-12-02 20:32:56,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:56,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:56,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:56,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 20:32:56,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:56,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:56,589 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-02 20:32:56,589 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:56,591 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:56,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:56,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:32:56,758 INFO L272 AbstractInterpreter]: Visited 126 different actions 370 times. Merged at 6 different actions 12 times. Never widened. Performed 4884 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4884 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-12-02 20:32:56,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:56,764 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:32:56,908 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 83.47% of their original sizes. [2018-12-02 20:32:56,908 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:32:56,956 INFO L418 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-12-02 20:32:56,956 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:32:56,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:32:56,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 20:32:56,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:32:56,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:32:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:32:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:32:56,957 INFO L87 Difference]: Start difference. First operand 6372 states and 7694 transitions. Second operand 10 states. [2018-12-02 20:32:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:59,060 INFO L93 Difference]: Finished difference Result 12736 states and 15481 transitions. [2018-12-02 20:32:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:32:59,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-12-02 20:32:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:59,070 INFO L225 Difference]: With dead ends: 12736 [2018-12-02 20:32:59,070 INFO L226 Difference]: Without dead ends: 7059 [2018-12-02 20:32:59,075 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:32:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2018-12-02 20:32:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 7055. [2018-12-02 20:32:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7055 states. [2018-12-02 20:32:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 8462 transitions. [2018-12-02 20:32:59,147 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 8462 transitions. Word has length 211 [2018-12-02 20:32:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:59,148 INFO L480 AbstractCegarLoop]: Abstraction has 7055 states and 8462 transitions. [2018-12-02 20:32:59,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:32:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 8462 transitions. [2018-12-02 20:32:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-02 20:32:59,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:59,154 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:59,154 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:59,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash 631030518, now seen corresponding path program 1 times [2018-12-02 20:32:59,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:32:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:59,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:59,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:32:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 20:32:59,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:59,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:32:59,225 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-12-02 20:32:59,225 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:32:59,226 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:32:59,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:32:59,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:32:59,545 INFO L272 AbstractInterpreter]: Visited 127 different actions 501 times. Merged at 8 different actions 26 times. Never widened. Performed 7190 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-02 20:32:59,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:59,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:32:59,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:59,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:59,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:32:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:59,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 20:32:59,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:32:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 20:32:59,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:32:59,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-02 20:32:59,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:32:59,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:32:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:32:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:59,716 INFO L87 Difference]: Start difference. First operand 7055 states and 8462 transitions. Second operand 8 states. [2018-12-02 20:33:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:33:00,618 INFO L93 Difference]: Finished difference Result 13732 states and 17056 transitions. [2018-12-02 20:33:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 20:33:00,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-12-02 20:33:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:33:00,635 INFO L225 Difference]: With dead ends: 13732 [2018-12-02 20:33:00,636 INFO L226 Difference]: Without dead ends: 8055 [2018-12-02 20:33:00,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-12-02 20:33:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2018-12-02 20:33:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 7137. [2018-12-02 20:33:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7137 states. [2018-12-02 20:33:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 8432 transitions. [2018-12-02 20:33:00,725 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 8432 transitions. Word has length 227 [2018-12-02 20:33:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:33:00,725 INFO L480 AbstractCegarLoop]: Abstraction has 7137 states and 8432 transitions. [2018-12-02 20:33:00,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:33:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 8432 transitions. [2018-12-02 20:33:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 20:33:00,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:33:00,732 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:33:00,732 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:33:00,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1225400414, now seen corresponding path program 1 times [2018-12-02 20:33:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:33:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:00,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:33:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 165 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 20:33:00,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:00,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:33:00,843 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-12-02 20:33:00,843 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:33:00,845 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:33:00,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:33:01,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:33:01,091 INFO L272 AbstractInterpreter]: Visited 127 different actions 508 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Performed 7095 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7095 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 20:33:01,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:01,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:33:01,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:01,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:33:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:01,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:33:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:01,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:33:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 20:33:01,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:33:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 20:33:01,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:33:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-12-02 20:33:01,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:33:01,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 20:33:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 20:33:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:33:01,287 INFO L87 Difference]: Start difference. First operand 7137 states and 8432 transitions. Second operand 12 states. [2018-12-02 20:33:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:33:02,838 INFO L93 Difference]: Finished difference Result 13793 states and 17724 transitions. [2018-12-02 20:33:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 20:33:02,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2018-12-02 20:33:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:33:02,852 INFO L225 Difference]: With dead ends: 13793 [2018-12-02 20:33:02,852 INFO L226 Difference]: Without dead ends: 7627 [2018-12-02 20:33:02,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 20:33:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2018-12-02 20:33:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 6800. [2018-12-02 20:33:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6800 states. [2018-12-02 20:33:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6800 states to 6800 states and 7743 transitions. [2018-12-02 20:33:02,963 INFO L78 Accepts]: Start accepts. Automaton has 6800 states and 7743 transitions. Word has length 237 [2018-12-02 20:33:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:33:02,963 INFO L480 AbstractCegarLoop]: Abstraction has 6800 states and 7743 transitions. [2018-12-02 20:33:02,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 20:33:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6800 states and 7743 transitions. [2018-12-02 20:33:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-02 20:33:02,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:33:02,968 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:33:02,968 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:33:02,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1307278761, now seen corresponding path program 1 times [2018-12-02 20:33:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:33:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:02,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:33:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 20:33:03,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:03,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:33:03,070 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-12-02 20:33:03,070 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:33:03,071 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:33:03,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:33:03,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:33:03,365 INFO L272 AbstractInterpreter]: Visited 128 different actions 632 times. Merged at 9 different actions 36 times. Never widened. Performed 8796 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8796 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-02 20:33:03,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:03,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:33:03,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:03,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:33:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:03,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:33:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:03,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:33:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-02 20:33:03,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:33:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-02 20:33:03,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:33:03,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-02 20:33:03,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:33:03,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 20:33:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 20:33:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:33:03,593 INFO L87 Difference]: Start difference. First operand 6800 states and 7743 transitions. Second operand 12 states. [2018-12-02 20:33:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:33:05,633 INFO L93 Difference]: Finished difference Result 12919 states and 15090 transitions. [2018-12-02 20:33:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 20:33:05,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 253 [2018-12-02 20:33:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:33:05,646 INFO L225 Difference]: With dead ends: 12919 [2018-12-02 20:33:05,646 INFO L226 Difference]: Without dead ends: 6234 [2018-12-02 20:33:05,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 528 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=385, Invalid=1507, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 20:33:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2018-12-02 20:33:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 4671. [2018-12-02 20:33:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2018-12-02 20:33:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 5155 transitions. [2018-12-02 20:33:05,705 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 5155 transitions. Word has length 253 [2018-12-02 20:33:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:33:05,706 INFO L480 AbstractCegarLoop]: Abstraction has 4671 states and 5155 transitions. [2018-12-02 20:33:05,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 20:33:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 5155 transitions. [2018-12-02 20:33:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-02 20:33:05,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:33:05,709 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:33:05,710 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:33:05,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1500745214, now seen corresponding path program 1 times [2018-12-02 20:33:05,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:33:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:05,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:33:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 229 proven. 112 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 20:33:05,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:05,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:33:05,799 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-12-02 20:33:05,800 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [77], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:33:05,801 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:33:05,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:33:06,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:33:06,052 INFO L272 AbstractInterpreter]: Visited 129 different actions 512 times. Merged at 10 different actions 29 times. Never widened. Performed 7299 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-02 20:33:06,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:06,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:33:06,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:06,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:33:06,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:06,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:33:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:06,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:33:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-02 20:33:06,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:33:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-02 20:33:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:33:06,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-02 20:33:06,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:33:06,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:33:06,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:33:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:33:06,241 INFO L87 Difference]: Start difference. First operand 4671 states and 5155 transitions. Second operand 3 states. [2018-12-02 20:33:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:33:06,429 INFO L93 Difference]: Finished difference Result 8504 states and 9427 transitions. [2018-12-02 20:33:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:33:06,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-12-02 20:33:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:33:06,437 INFO L225 Difference]: With dead ends: 8504 [2018-12-02 20:33:06,437 INFO L226 Difference]: Without dead ends: 4671 [2018-12-02 20:33:06,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 542 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:33:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2018-12-02 20:33:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4530. [2018-12-02 20:33:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4530 states. [2018-12-02 20:33:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 4975 transitions. [2018-12-02 20:33:06,511 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 4975 transitions. Word has length 271 [2018-12-02 20:33:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:33:06,512 INFO L480 AbstractCegarLoop]: Abstraction has 4530 states and 4975 transitions. [2018-12-02 20:33:06,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:33:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 4975 transitions. [2018-12-02 20:33:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-02 20:33:06,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:33:06,517 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-12-02 20:33:06,517 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:33:06,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 639701469, now seen corresponding path program 1 times [2018-12-02 20:33:06,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:33:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:33:06,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:33:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-12-02 20:33:06,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:06,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:33:06,635 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-12-02 20:33:06,636 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:33:06,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:33:06,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:33:06,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:33:06,916 INFO L272 AbstractInterpreter]: Visited 128 different actions 509 times. Merged at 8 different actions 30 times. Never widened. Performed 7149 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 20:33:06,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:33:06,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:33:06,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:33:06,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:33:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:33:06,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:33:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:33:06,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:33:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-12-02 20:33:07,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:33:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-12-02 20:33:07,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:33:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-02 20:33:07,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:33:07,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:33:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:33:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:33:07,095 INFO L87 Difference]: Start difference. First operand 4530 states and 4975 transitions. Second operand 9 states. [2018-12-02 20:33:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:33:07,489 INFO L93 Difference]: Finished difference Result 7825 states and 8675 transitions. [2018-12-02 20:33:07,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:33:07,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 275 [2018-12-02 20:33:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:33:07,490 INFO L225 Difference]: With dead ends: 7825 [2018-12-02 20:33:07,490 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:33:07,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-12-02 20:33:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:33:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:33:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:33:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:33:07,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2018-12-02 20:33:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:33:07,498 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:33:07,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:33:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:33:07,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:33:07,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 20:33:07,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,850 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 290 [2018-12-02 20:33:07,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:07,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:08,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:08,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:08,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:08,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:33:08,086 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 308 [2018-12-02 20:33:09,327 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 253 DAG size of output: 92 [2018-12-02 20:33:10,275 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 91 [2018-12-02 20:33:11,192 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2018-12-02 20:33:11,193 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-02 20:33:11,194 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-02 20:33:11,195 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-02 20:33:11,196 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,197 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,198 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-02 20:33:11,199 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,200 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse15 (= 1 ~a21~0)) (.cse16 (<= |old(~a8~0)| ~a8~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse14 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse27 (= 1 |old(~a17~0)|)) (.cse25 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse25)) (.cse21 (< 4 |old(~a16~0)|)) (.cse9 (not .cse27)) (.cse18 (and .cse4 .cse14 .cse5 .cse6 .cse7 .cse8)) (.cse22 (< 0 |old(~a21~0)|)) (.cse20 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse14 .cse5 .cse7 .cse16 .cse8)) (.cse19 (< 14 |old(~a8~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse29 (< |old(~a8~0)| 15)) (.cse24 (= 6 |old(~a16~0)|)) (.cse26 (< |old(~a8~0)| 14)) (.cse28 (and .cse4 .cse14 .cse5 .cse7 .cse16 .cse15 .cse8)) (.cse23 (< 0 |old(~a20~0)|)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse17 (= ~a20~0 1)) (.cse3 (not (= 8 ~a12~0))) (.cse12 (= |calculate_output_#in~input| 0)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse1 .cse13 (not (= 5 |old(~a16~0)|)) (and .cse14 .cse15 .cse5 .cse7 .cse16 .cse17 (= ~a16~0 5))) (or .cse0 .cse1 .cse18 .cse2 .cse3 .cse19) (or .cse20 .cse21 .cse3 .cse19 .cse22 .cse23) (or .cse24 .cse11 .cse25 .cse26 .cse3 .cse27 .cse28 .cse19) (or .cse19 .cse20 (or .cse1 .cse21 .cse3 .cse9)) (or .cse11 .cse28 (or .cse0 .cse25 .cse1 .cse3 .cse27) .cse29) (or .cse0 .cse1 .cse18 .cse3 .cse19 .cse9) (or .cse25 .cse3 (< |old(~a20~0)| 1) .cse27 .cse19 .cse22 .cse20) (or (or .cse10 .cse11 .cse13 .cse3 .cse12 .cse23) .cse28) (or .cse24 .cse0 .cse18 .cse3 .cse27 .cse19 .cse23) (or (or .cse24 .cse1 .cse3 .cse22) .cse20 .cse19) (or .cse24 .cse11 .cse0 .cse3 .cse28 .cse29 .cse23) (or .cse24 .cse11 .cse26 .cse28 .cse3 .cse27 .cse23) (or .cse10 .cse11 (and .cse4 .cse14 .cse15 .cse5 .cse7 .cse16 .cse17) .cse3 .cse12 .cse1 .cse13 .cse27)))) [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-02 20:33:11,201 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-02 20:33:11,202 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:33:11,203 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-12-02 20:33:11,203 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 20:33:11,204 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:33:11,204 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (<= ~a8~0 |old(~a8~0)|) (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 1) (= ~a16~0 5))) [2018-12-02 20:33:11,204 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-02 20:33:11,204 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse5 (<= 14 ~a8~0)) (.cse11 (<= ~a8~0 |old(~a8~0)|)) (.cse12 (= ~a7~0 |old(~a7~0)|)) (.cse13 (<= |old(~a8~0)| ~a8~0)) (.cse14 (= ~a20~0 |old(~a20~0)|)) (.cse10 (not (= main_~input~0 0))) (.cse3 (<= ~a20~0 0)) (.cse9 (<= ~a16~0 4)) (.cse1 (not (= ~a16~0 6))) (.cse8 (<= ~a21~0 0)) (.cse18 (= 4 ~a16~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse4 (<= ~a8~0 14)) (.cse17 (= 1 ~a17~0)) (.cse15 (<= 15 ~a8~0)) (.cse0 (not (= ~a7~0 1))) (.cse2 (not (= ~a17~0 1))) (.cse7 (not (= ~a16~0 4))) (.cse19 (= 1 ~a20~0)) (.cse6 (= 1 ~a21~0))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4) (not (= 1 |old(~a20~0)|)) (and .cse5 .cse1 .cse6 .cse2 .cse4 .cse7) (not (= 5 |old(~a16~0)|)) (and .cse8 .cse4 .cse3 .cse9) (and .cse10 .cse2 .cse11 .cse12 .cse13 .cse6 .cse14) (and (and (and .cse0 .cse1 .cse3) .cse15) .cse6) (and (and .cse1 .cse2 .cse3) .cse5 .cse6) (and .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 (= ~a16~0 5)) (and (= ~a7~0 0) .cse10 (= ~a8~0 15) (= ~a21~0 1) .cse3) (and (and .cse16 .cse9 .cse17) .cse4) (and .cse0 .cse16 .cse18 .cse17) (and .cse4 (and .cse8 .cse19 .cse1)) (and .cse8 .cse2 .cse4 (<= 1 ~a20~0) .cse7) (not (= 0 |old(~a7~0)|)) (and .cse0 .cse16 .cse18 .cse4) (not (= 1 |old(~a17~0)|)) (and .cse0 .cse16 .cse4 .cse17) (and .cse15 (and (and .cse0 .cse2 .cse7) .cse19) .cse6) (not (= 15 |old(~a8~0)|)))) [2018-12-02 20:33:11,204 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-02 20:33:11,204 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-02 20:33:11,204 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (<= ~a8~0 |old(~a8~0)|)) (.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse10 (<= |old(~a8~0)| ~a8~0)) (.cse11 (= ~a20~0 |old(~a20~0)|)) (.cse5 (<= 14 ~a8~0)) (.cse3 (<= ~a20~0 0)) (.cse13 (<= ~a16~0 4)) (.cse1 (not (= ~a16~0 6))) (.cse12 (<= ~a21~0 0)) (.cse17 (= 4 ~a16~0)) (.cse15 (= |old(~a20~0)| ~a20~0)) (.cse4 (<= ~a8~0 14)) (.cse16 (= 1 ~a17~0)) (.cse14 (<= 15 ~a8~0)) (.cse0 (not (= ~a7~0 1))) (.cse2 (not (= ~a17~0 1))) (.cse7 (not (= ~a16~0 4))) (.cse18 (= 1 ~a20~0)) (.cse6 (= 1 ~a21~0))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4) (not (= 1 |old(~a20~0)|)) (and .cse5 .cse1 .cse6 .cse2 .cse4 .cse7) (not (= 5 |old(~a16~0)|)) (and .cse8 .cse9 .cse10 .cse6 .cse11 (= ~a16~0 5)) (and .cse12 .cse4 .cse3 .cse13) (and (not (= main_~input~0 0)) .cse2 .cse8 .cse9 .cse10 .cse6 .cse11) (and (and (and .cse0 .cse1 .cse3) .cse14) .cse6) (and (and .cse1 .cse2 .cse3) .cse5 .cse6) (and (and (= ~a7~0 0) (= ~a8~0 15) .cse3) .cse6) (and (and .cse15 .cse13 .cse16) .cse4) (and .cse0 .cse15 .cse17 .cse16) (and .cse4 (and .cse12 .cse18 .cse1)) (and .cse12 .cse2 .cse4 (<= 1 ~a20~0) .cse7) (not (= 0 |old(~a7~0)|)) (and .cse0 .cse15 .cse17 .cse4) (not (= 1 |old(~a17~0)|)) (and .cse0 .cse15 .cse4 .cse16) (and .cse14 (and (and .cse0 .cse2 .cse7) .cse18) .cse6) (not (= 15 |old(~a8~0)|)))) [2018-12-02 20:33:11,204 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-02 20:33:11,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:33:11 BoogieIcfgContainer [2018-12-02 20:33:11,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:33:11,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:33:11,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:33:11,216 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:33:11,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42" (3/4) ... [2018-12-02 20:33:11,219 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:33:11,222 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:33:11,222 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 20:33:11,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:33:11,231 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 20:33:11,232 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 20:33:11,250 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((((a8 <= \old(a8) && a7 == \old(a7)) && \old(a8) <= a8) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && \old(a8) <= a8) && 1 == a21) && a20 == \old(a20))) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || (((a7 == 0 && a8 == 15) && a20 <= 0) && 1 == a21)) || (((\old(a20) == a20 && a16 <= 4) && 1 == a17) && a8 <= 14)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || (a8 <= 14 && (a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(0 == \old(a7))) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && a8 <= 14)) || !(1 == \old(a17))) || (((!(a7 == 1) && \old(a20) == a20) && a8 <= 14) && 1 == a17)) || ((15 <= a8 && ((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || !(15 == \old(a8)) [2018-12-02 20:33:11,304 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_543c1ea4-6815-4400-a5ed-1109d39aa4bf/bin-2019/utaipan/witness.graphml [2018-12-02 20:33:11,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:33:11,304 INFO L168 Benchmark]: Toolchain (without parser) took 29971.59 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 947.2 MB in the beginning and 790.0 MB in the end (delta: 157.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,305 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:33:11,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,306 INFO L168 Benchmark]: Boogie Preprocessor took 46.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,306 INFO L168 Benchmark]: RCFGBuilder took 636.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,306 INFO L168 Benchmark]: TraceAbstraction took 28836.31 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 988.9 MB in the beginning and 816.6 MB in the end (delta: 172.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,306 INFO L168 Benchmark]: Witness Printer took 88.71 ms. Allocated memory is still 2.3 GB. Free memory was 816.6 MB in the beginning and 790.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:33:11,308 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 636.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.9 MB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28836.31 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 988.9 MB in the beginning and 816.6 MB in the end (delta: 172.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 88.71 ms. Allocated memory is still 2.3 GB. Free memory was 816.6 MB in the beginning and 790.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((((a8 <= \old(a8) && a7 == \old(a7)) && \old(a8) <= a8) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && \old(a8) <= a8) && 1 == a21) && a20 == \old(a20))) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || (((a7 == 0 && a8 == 15) && a20 <= 0) && 1 == a21)) || (((\old(a20) == a20 && a16 <= 4) && 1 == a17) && a8 <= 14)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || (a8 <= 14 && (a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(0 == \old(a7))) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && a8 <= 14)) || !(1 == \old(a17))) || (((!(a7 == 1) && \old(a20) == a20) && a8 <= 14) && 1 == a17)) || ((15 <= a8 && ((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || !(15 == \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 28.7s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 842 SDtfs, 12736 SDslu, 1088 SDs, 0 SdLazy, 15099 SolverSat, 2161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4108 GetRequests, 3848 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7137occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9973502961380487 AbsIntWeakeningRatio, 0.21058558558558557 AbsIntAvgWeakeningVarsNumRemoved, 28.756756756756758 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 3513 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 344 PreInvPairs, 442 NumberOfFragments, 1355 HoareAnnotationTreeSize, 344 FomulaSimplifications, 52823 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 48968 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4611 NumberOfCodeBlocks, 4611 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6047 ConstructedInterpolants, 0 QuantifiedInterpolants, 3052540 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3976 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5093/5510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...