./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/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_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/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-5842f4b [2018-11-18 18:02:52,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 18:02:52,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 18:02:52,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 18:02:52,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 18:02:52,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 18:02:52,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 18:02:52,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 18:02:52,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 18:02:52,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 18:02:52,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 18:02:52,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 18:02:52,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 18:02:52,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 18:02:52,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 18:02:52,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 18:02:52,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 18:02:52,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 18:02:52,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 18:02:52,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 18:02:52,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 18:02:52,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 18:02:52,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 18:02:52,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 18:02:52,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 18:02:52,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 18:02:52,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 18:02:52,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 18:02:52,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 18:02:52,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 18:02:52,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 18:02:52,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 18:02:52,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 18:02:52,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 18:02:52,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 18:02:52,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 18:02:52,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 18:02:52,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 18:02:52,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 18:02:52,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 18:02:52,608 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 18:02:52,608 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 18:02:52,609 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 18:02:52,609 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 18:02:52,609 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 18:02:52,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 18:02:52,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 18:02:52,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 18:02:52,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 18:02:52,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 18:02:52,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 18:02:52,612 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 18:02:52,613 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_483f3865-a704-4191-b275-e8d030b8c3ee/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-11-18 18:02:52,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 18:02:52,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 18:02:52,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 18:02:52,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 18:02:52,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 18:02:52,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-18 18:02:52,692 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/data/a3031fdb8/099fa8a4b1244421921cea5db4bbb79b/FLAGb7db66345 [2018-11-18 18:02:53,057 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 18:02:53,058 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-18 18:02:53,067 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/data/a3031fdb8/099fa8a4b1244421921cea5db4bbb79b/FLAGb7db66345 [2018-11-18 18:02:53,079 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/data/a3031fdb8/099fa8a4b1244421921cea5db4bbb79b [2018-11-18 18:02:53,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 18:02:53,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 18:02:53,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 18:02:53,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 18:02:53,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 18:02:53,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ec56fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53, skipping insertion in model container [2018-11-18 18:02:53,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 18:02:53,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 18:02:53,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:02:53,353 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 18:02:53,421 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 18:02:53,433 INFO L195 MainTranslator]: Completed translation [2018-11-18 18:02:53,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53 WrapperNode [2018-11-18 18:02:53,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 18:02:53,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 18:02:53,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 18:02:53,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 18:02:53,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 18:02:53,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 18:02:53,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 18:02:53,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 18:02:53,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... [2018-11-18 18:02:53,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 18:02:53,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 18:02:53,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 18:02:53,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 18:02:53,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 18:02:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 18:02:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 18:02:53,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 18:02:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 18:02:53,613 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 18:02:53,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 18:02:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 18:02:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 18:02:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 18:02:54,401 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 18:02:54,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:02:54 BoogieIcfgContainer [2018-11-18 18:02:54,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 18:02:54,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 18:02:54,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 18:02:54,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 18:02:54,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:02:53" (1/3) ... [2018-11-18 18:02:54,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1a3503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:02:54, skipping insertion in model container [2018-11-18 18:02:54,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:02:53" (2/3) ... [2018-11-18 18:02:54,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1a3503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:02:54, skipping insertion in model container [2018-11-18 18:02:54,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:02:54" (3/3) ... [2018-11-18 18:02:54,407 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-11-18 18:02:54,413 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 18:02:54,418 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 18:02:54,427 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 18:02:54,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 18:02:54,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 18:02:54,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 18:02:54,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 18:02:54,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 18:02:54,449 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 18:02:54,449 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 18:02:54,449 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 18:02:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 18:02:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 18:02:54,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:54,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:54,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:54,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-11-18 18:02:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:54,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:54,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:54,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 18:02:54,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:54,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 18:02:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 18:02:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 18:02:54,783 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 18:02:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:55,352 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 18:02:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 18:02:55,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-18 18:02:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:55,362 INFO L225 Difference]: With dead ends: 550 [2018-11-18 18:02:55,362 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 18:02:55,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 18:02:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 18:02:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 18:02:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 18:02:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-18 18:02:55,409 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-11-18 18:02:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:55,409 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-18 18:02:55,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 18:02:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-18 18:02:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 18:02:55,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:55,413 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:55,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:55,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-11-18 18:02:55,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:55,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:55,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:55,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:55,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 18:02:55,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:55,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 18:02:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 18:02:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 18:02:55,520 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-18 18:02:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:56,083 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-18 18:02:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 18:02:56,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-11-18 18:02:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:56,087 INFO L225 Difference]: With dead ends: 888 [2018-11-18 18:02:56,087 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 18:02:56,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:02:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 18:02:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-18 18:02:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-18 18:02:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-18 18:02:56,109 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-11-18 18:02:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:56,110 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-18 18:02:56,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 18:02:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-18 18:02:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 18:02:56,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:56,112 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:56,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-11-18 18:02:56,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:56,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:56,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:56,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 18:02:56,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:56,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 18:02:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 18:02:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:02:56,307 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-18 18:02:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:56,765 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-18 18:02:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 18:02:56,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-18 18:02:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:56,768 INFO L225 Difference]: With dead ends: 1210 [2018-11-18 18:02:56,768 INFO L226 Difference]: Without dead ends: 536 [2018-11-18 18:02:56,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:02:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-18 18:02:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-18 18:02:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-18 18:02:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-18 18:02:56,783 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-11-18 18:02:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:56,783 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-18 18:02:56,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 18:02:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-18 18:02:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 18:02:56,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:56,785 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:56,785 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:56,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-11-18 18:02:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:56,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:56,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:56,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:56,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 18:02:56,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:56,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 18:02:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 18:02:56,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:02:56,973 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-18 18:02:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:57,462 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-18 18:02:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 18:02:57,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-18 18:02:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:57,465 INFO L225 Difference]: With dead ends: 1204 [2018-11-18 18:02:57,465 INFO L226 Difference]: Without dead ends: 535 [2018-11-18 18:02:57,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 18:02:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-18 18:02:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-18 18:02:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-18 18:02:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-18 18:02:57,480 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-11-18 18:02:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:57,480 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-18 18:02:57,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 18:02:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-18 18:02:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 18:02:57,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:57,482 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:57,482 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:57,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-11-18 18:02:57,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:57,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:57,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:57,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 18:02:57,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:57,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 18:02:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 18:02:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 18:02:57,563 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-18 18:02:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:57,984 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-18 18:02:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 18:02:57,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-18 18:02:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:57,988 INFO L225 Difference]: With dead ends: 1521 [2018-11-18 18:02:57,988 INFO L226 Difference]: Without dead ends: 992 [2018-11-18 18:02:57,990 INFO L604 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-11-18 18:02:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-18 18:02:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-18 18:02:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-18 18:02:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-18 18:02:58,014 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-11-18 18:02:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:58,015 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-18 18:02:58,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 18:02:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-18 18:02:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 18:02:58,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:58,018 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:58,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:58,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-11-18 18:02:58,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:58,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:02:58,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 18:02:58,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 18:02:58,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:58,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 18:02:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 18:02:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 18:02:58,078 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-18 18:02:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:02:58,658 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-18 18:02:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 18:02:58,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-18 18:02:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:02:58,665 INFO L225 Difference]: With dead ends: 2947 [2018-11-18 18:02:58,665 INFO L226 Difference]: Without dead ends: 1961 [2018-11-18 18:02:58,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:02:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-18 18:02:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-18 18:02:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-18 18:02:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-18 18:02:58,703 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-11-18 18:02:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:02:58,704 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-18 18:02:58,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 18:02:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-18 18:02:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 18:02:58,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:02:58,708 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:02:58,708 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:02:58,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-11-18 18:02:58,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:02:58,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:58,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:02:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:02:58,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:02:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:02:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 18:02:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:02:58,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:02:58,808 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-18 18:02:58,810 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:02:58,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:02:58,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:02:59,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:02:59,185 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 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-11-18 18:02:59,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:02:59,202 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:02:59,496 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.49% of their original sizes. [2018-11-18 18:02:59,497 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:02:59,535 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-18 18:02:59,535 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:02:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:02:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-18 18:02:59,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:02:59,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 18:02:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 18:02:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 18:02:59,537 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-11-18 18:03:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:01,524 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-11-18 18:03:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 18:03:01,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-18 18:03:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:01,529 INFO L225 Difference]: With dead ends: 3988 [2018-11-18 18:03:01,529 INFO L226 Difference]: Without dead ends: 2066 [2018-11-18 18:03:01,532 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 18:03:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-18 18:03:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-11-18 18:03:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-11-18 18:03:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-11-18 18:03:01,562 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 148 [2018-11-18 18:03:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:01,563 INFO L480 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-11-18 18:03:01,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 18:03:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-11-18 18:03:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-18 18:03:01,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:01,567 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 18:03:01,567 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:01,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-11-18 18:03:01,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:01,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:03:01,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:01,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:01,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-11-18 18:03:01,626 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:01,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:01,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:01,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:01,812 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 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-11-18 18:03:01,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:01,818 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:02,022 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 81.94% of their original sizes. [2018-11-18 18:03:02,023 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:02,071 INFO L415 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2018-11-18 18:03:02,072 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:02,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:02,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 18:03:02,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:02,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 18:03:02,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 18:03:02,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 18:03:02,073 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-11-18 18:03:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:05,621 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-11-18 18:03:05,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 18:03:05,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2018-11-18 18:03:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:05,628 INFO L225 Difference]: With dead ends: 4127 [2018-11-18 18:03:05,628 INFO L226 Difference]: Without dead ends: 2205 [2018-11-18 18:03:05,633 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 18:03:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-11-18 18:03:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-11-18 18:03:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-11-18 18:03:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-11-18 18:03:05,680 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 157 [2018-11-18 18:03:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:05,681 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-11-18 18:03:05,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 18:03:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-11-18 18:03:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 18:03:05,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:05,686 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-18 18:03:05,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:05,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash 949105357, now seen corresponding path program 1 times [2018-11-18 18:03:05,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:05,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:05,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 18:03:05,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:05,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:05,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-18 18:03:05,784 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:05,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:05,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:06,058 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:06,058 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 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-11-18 18:03:06,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:06,070 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:06,284 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 81.88% of their original sizes. [2018-11-18 18:03:06,284 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:06,347 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-18 18:03:06,347 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:06,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:06,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 18:03:06,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:06,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 18:03:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 18:03:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 18:03:06,348 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 10 states. [2018-11-18 18:03:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:08,288 INFO L93 Difference]: Finished difference Result 4541 states and 5909 transitions. [2018-11-18 18:03:08,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 18:03:08,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-11-18 18:03:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:08,296 INFO L225 Difference]: With dead ends: 4541 [2018-11-18 18:03:08,297 INFO L226 Difference]: Without dead ends: 2619 [2018-11-18 18:03:08,302 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 18:03:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2018-11-18 18:03:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2616. [2018-11-18 18:03:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-11-18 18:03:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3280 transitions. [2018-11-18 18:03:08,353 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3280 transitions. Word has length 190 [2018-11-18 18:03:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:08,353 INFO L480 AbstractCegarLoop]: Abstraction has 2616 states and 3280 transitions. [2018-11-18 18:03:08,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 18:03:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3280 transitions. [2018-11-18 18:03:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 18:03:08,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:08,360 INFO L375 BasicCegarLoop]: trace histogram [4, 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-11-18 18:03:08,360 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:08,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1559476336, now seen corresponding path program 1 times [2018-11-18 18:03:08,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:08,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:08,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:08,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:08,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 18:03:08,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:08,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:08,484 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-18 18:03:08,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:08,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:08,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:08,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:08,665 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 8 different actions 19 times. Never widened. Performed 5018 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5018 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 18:03:08,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:08,670 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:08,860 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 83.47% of their original sizes. [2018-11-18 18:03:08,860 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:08,921 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-18 18:03:08,921 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:08,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:08,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-18 18:03:08,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:08,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 18:03:08,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 18:03:08,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:03:08,922 INFO L87 Difference]: Start difference. First operand 2616 states and 3280 transitions. Second operand 9 states. [2018-11-18 18:03:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:11,238 INFO L93 Difference]: Finished difference Result 5387 states and 6923 transitions. [2018-11-18 18:03:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 18:03:11,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-11-18 18:03:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:11,247 INFO L225 Difference]: With dead ends: 5387 [2018-11-18 18:03:11,247 INFO L226 Difference]: Without dead ends: 3465 [2018-11-18 18:03:11,251 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-18 18:03:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2018-11-18 18:03:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3449. [2018-11-18 18:03:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-18 18:03:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4285 transitions. [2018-11-18 18:03:11,317 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4285 transitions. Word has length 199 [2018-11-18 18:03:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:11,318 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4285 transitions. [2018-11-18 18:03:11,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 18:03:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4285 transitions. [2018-11-18 18:03:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 18:03:11,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:11,326 INFO L375 BasicCegarLoop]: trace histogram [5, 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-11-18 18:03:11,326 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:11,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1041225973, now seen corresponding path program 1 times [2018-11-18 18:03:11,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:11,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:11,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 18:03:11,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:11,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:11,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-18 18:03:11,442 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:11,444 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:11,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:11,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:11,762 INFO L272 AbstractInterpreter]: Visited 128 different actions 509 times. Merged at 9 different actions 33 times. Never widened. Performed 7094 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7094 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-11-18 18:03:11,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:11,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:11,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:11,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:03:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:11,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:11,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 18:03:11,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 18:03:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 18:03:12,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:12,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 18:03:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 18:03:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 18:03:12,120 INFO L87 Difference]: Start difference. First operand 3449 states and 4285 transitions. Second operand 11 states. [2018-11-18 18:03:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:13,451 INFO L93 Difference]: Finished difference Result 11301 states and 14998 transitions. [2018-11-18 18:03:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 18:03:13,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-11-18 18:03:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:13,474 INFO L225 Difference]: With dead ends: 11301 [2018-11-18 18:03:13,474 INFO L226 Difference]: Without dead ends: 8408 [2018-11-18 18:03:13,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-18 18:03:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8408 states. [2018-11-18 18:03:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8408 to 8335. [2018-11-18 18:03:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8335 states. [2018-11-18 18:03:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8335 states to 8335 states and 10417 transitions. [2018-11-18 18:03:13,654 INFO L78 Accepts]: Start accepts. Automaton has 8335 states and 10417 transitions. Word has length 207 [2018-11-18 18:03:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 8335 states and 10417 transitions. [2018-11-18 18:03:13,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 18:03:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 8335 states and 10417 transitions. [2018-11-18 18:03:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 18:03:13,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:13,669 INFO L375 BasicCegarLoop]: trace histogram [5, 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-11-18 18:03:13,670 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:13,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 69921341, now seen corresponding path program 1 times [2018-11-18 18:03:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:13,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:13,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 18:03:13,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:13,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:13,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-18 18:03:13,800 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:13,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:13,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:13,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 18:03:13,969 INFO L272 AbstractInterpreter]: Visited 127 different actions 373 times. Merged at 7 different actions 14 times. Never widened. Performed 4866 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 18:03:13,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:13,974 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 18:03:14,134 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 83.64% of their original sizes. [2018-11-18 18:03:14,135 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 18:03:14,172 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-18 18:03:14,172 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 18:03:14,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:14,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 18:03:14,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:14,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 18:03:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 18:03:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:03:14,173 INFO L87 Difference]: Start difference. First operand 8335 states and 10417 transitions. Second operand 9 states. [2018-11-18 18:03:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:16,518 INFO L93 Difference]: Finished difference Result 16663 states and 20928 transitions. [2018-11-18 18:03:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 18:03:16,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2018-11-18 18:03:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:16,536 INFO L225 Difference]: With dead ends: 16663 [2018-11-18 18:03:16,536 INFO L226 Difference]: Without dead ends: 9028 [2018-11-18 18:03:16,549 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-18 18:03:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9028 states. [2018-11-18 18:03:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9028 to 9023. [2018-11-18 18:03:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9023 states. [2018-11-18 18:03:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9023 states to 9023 states and 11190 transitions. [2018-11-18 18:03:16,648 INFO L78 Accepts]: Start accepts. Automaton has 9023 states and 11190 transitions. Word has length 216 [2018-11-18 18:03:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:16,648 INFO L480 AbstractCegarLoop]: Abstraction has 9023 states and 11190 transitions. [2018-11-18 18:03:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 18:03:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9023 states and 11190 transitions. [2018-11-18 18:03:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-18 18:03:16,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:16,657 INFO L375 BasicCegarLoop]: trace histogram [5, 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-11-18 18:03:16,658 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:16,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -969326417, now seen corresponding path program 1 times [2018-11-18 18:03:16,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:16,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:16,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:16,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:16,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 18:03:16,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:16,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:16,744 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-18 18:03:16,745 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:16,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:16,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:16,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:16,999 INFO L272 AbstractInterpreter]: Visited 128 different actions 501 times. Merged at 9 different actions 25 times. Never widened. Performed 7129 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7129 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 18:03:17,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:17,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:17,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:17,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:03:17,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:17,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:17,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 18:03:17,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 18:03:17,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-18 18:03:17,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:17,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 18:03:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 18:03:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 18:03:17,310 INFO L87 Difference]: Start difference. First operand 9023 states and 11190 transitions. Second operand 8 states. [2018-11-18 18:03:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:18,479 INFO L93 Difference]: Finished difference Result 17816 states and 22777 transitions. [2018-11-18 18:03:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 18:03:18,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2018-11-18 18:03:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:18,505 INFO L225 Difference]: With dead ends: 17816 [2018-11-18 18:03:18,505 INFO L226 Difference]: Without dead ends: 10181 [2018-11-18 18:03:18,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-18 18:03:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2018-11-18 18:03:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 9269. [2018-11-18 18:03:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9269 states. [2018-11-18 18:03:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9269 states to 9269 states and 11124 transitions. [2018-11-18 18:03:18,613 INFO L78 Accepts]: Start accepts. Automaton has 9269 states and 11124 transitions. Word has length 232 [2018-11-18 18:03:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:18,614 INFO L480 AbstractCegarLoop]: Abstraction has 9269 states and 11124 transitions. [2018-11-18 18:03:18,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 18:03:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 9269 states and 11124 transitions. [2018-11-18 18:03:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-18 18:03:18,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:18,622 INFO L375 BasicCegarLoop]: trace histogram [5, 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-11-18 18:03:18,622 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:18,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1797507141, now seen corresponding path program 1 times [2018-11-18 18:03:18,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:18,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:18,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 174 proven. 52 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 18:03:18,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:18,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:18,738 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-18 18:03:18,738 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:18,740 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:18,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:18,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:18,981 INFO L272 AbstractInterpreter]: Visited 128 different actions 513 times. Merged at 9 different actions 37 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-11-18 18:03:18,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:18,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:18,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:18,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 18:03:19,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:19,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:19,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 18:03:19,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 18:03:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:19,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-11-18 18:03:19,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:19,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 18:03:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 18:03:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-18 18:03:19,215 INFO L87 Difference]: Start difference. First operand 9269 states and 11124 transitions. Second operand 12 states. [2018-11-18 18:03:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:20,838 INFO L93 Difference]: Finished difference Result 17898 states and 23108 transitions. [2018-11-18 18:03:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 18:03:20,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-11-18 18:03:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:20,866 INFO L225 Difference]: With dead ends: 17898 [2018-11-18 18:03:20,866 INFO L226 Difference]: Without dead ends: 9604 [2018-11-18 18:03:20,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 501 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-11-18 18:03:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2018-11-18 18:03:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 8789. [2018-11-18 18:03:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8789 states. [2018-11-18 18:03:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8789 states to 8789 states and 10116 transitions. [2018-11-18 18:03:21,062 INFO L78 Accepts]: Start accepts. Automaton has 8789 states and 10116 transitions. Word has length 242 [2018-11-18 18:03:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:21,063 INFO L480 AbstractCegarLoop]: Abstraction has 8789 states and 10116 transitions. [2018-11-18 18:03:21,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 18:03:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8789 states and 10116 transitions. [2018-11-18 18:03:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-18 18:03:21,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:21,072 INFO L375 BasicCegarLoop]: trace histogram [6, 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-11-18 18:03:21,072 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:21,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1055628796, now seen corresponding path program 1 times [2018-11-18 18:03:21,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:21,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:21,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 175 proven. 93 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 18:03:21,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:21,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:21,197 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-18 18:03:21,197 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:21,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:21,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:21,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:21,661 INFO L272 AbstractInterpreter]: Visited 129 different actions 637 times. Merged at 10 different actions 40 times. Never widened. Performed 8793 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8793 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 18:03:21,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:21,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:21,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:21,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/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-11-18 18:03:21,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:21,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:21,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 18:03:21,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 18:03:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 18:03:21,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 18:03:21,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 18:03:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-18 18:03:21,864 INFO L87 Difference]: Start difference. First operand 8789 states and 10116 transitions. Second operand 12 states. [2018-11-18 18:03:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:23,794 INFO L93 Difference]: Finished difference Result 17538 states and 20851 transitions. [2018-11-18 18:03:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 18:03:23,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 259 [2018-11-18 18:03:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:23,806 INFO L225 Difference]: With dead ends: 17538 [2018-11-18 18:03:23,806 INFO L226 Difference]: Without dead ends: 7549 [2018-11-18 18:03:23,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 18:03:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2018-11-18 18:03:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5863. [2018-11-18 18:03:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5863 states. [2018-11-18 18:03:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 6475 transitions. [2018-11-18 18:03:23,888 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 6475 transitions. Word has length 259 [2018-11-18 18:03:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:23,888 INFO L480 AbstractCegarLoop]: Abstraction has 5863 states and 6475 transitions. [2018-11-18 18:03:23,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 18:03:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 6475 transitions. [2018-11-18 18:03:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-18 18:03:23,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:23,893 INFO L375 BasicCegarLoop]: trace histogram [7, 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-11-18 18:03:23,893 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:23,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash -317338975, now seen corresponding path program 1 times [2018-11-18 18:03:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:23,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 246 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 18:03:24,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:24,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:24,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-18 18:03:24,008 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:24,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:24,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:24,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:24,260 INFO L272 AbstractInterpreter]: Visited 130 different actions 520 times. Merged at 11 different actions 36 times. Widened at 1 different actions 1 times. Performed 7342 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7342 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 18:03:24,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:24,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:24,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:24,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/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-11-18 18:03:24,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:24,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:24,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-18 18:03:24,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-18 18:03:24,557 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 18:03:24,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 18:03:24,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 18:03:24,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 18:03:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 18:03:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 18:03:24,558 INFO L87 Difference]: Start difference. First operand 5863 states and 6475 transitions. Second operand 3 states. [2018-11-18 18:03:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:24,968 INFO L93 Difference]: Finished difference Result 10882 states and 12061 transitions. [2018-11-18 18:03:24,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 18:03:24,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-18 18:03:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:24,975 INFO L225 Difference]: With dead ends: 10882 [2018-11-18 18:03:24,976 INFO L226 Difference]: Without dead ends: 5863 [2018-11-18 18:03:24,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 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-11-18 18:03:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5863 states. [2018-11-18 18:03:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5863 to 5589. [2018-11-18 18:03:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2018-11-18 18:03:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 6153 transitions. [2018-11-18 18:03:25,062 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 6153 transitions. Word has length 278 [2018-11-18 18:03:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:25,063 INFO L480 AbstractCegarLoop]: Abstraction has 5589 states and 6153 transitions. [2018-11-18 18:03:25,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 18:03:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 6153 transitions. [2018-11-18 18:03:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-18 18:03:25,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 18:03:25,069 INFO L375 BasicCegarLoop]: trace histogram [6, 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-11-18 18:03:25,069 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 18:03:25,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -757481712, now seen corresponding path program 1 times [2018-11-18 18:03:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 18:03:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 18:03:25,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 18:03:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-18 18:03:25,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:25,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 18:03:25,209 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-11-18 18:03:25,209 INFO L202 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], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 18:03:25,211 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 18:03:25,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 18:03:25,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 18:03:25,486 INFO L272 AbstractInterpreter]: Visited 129 different actions 515 times. Merged at 9 different actions 35 times. Never widened. Performed 7175 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 18:03:25,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 18:03:25,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 18:03:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 18:03:25,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/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-11-18 18:03:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 18:03:25,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 18:03:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 18:03:25,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 18:03:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-18 18:03:25,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 18:03:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-18 18:03:25,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 18:03:25,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 18:03:25,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 18:03:25,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 18:03:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 18:03:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 18:03:25,679 INFO L87 Difference]: Start difference. First operand 5589 states and 6153 transitions. Second operand 9 states. [2018-11-18 18:03:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 18:03:26,071 INFO L93 Difference]: Finished difference Result 9235 states and 10276 transitions. [2018-11-18 18:03:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 18:03:26,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-11-18 18:03:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 18:03:26,071 INFO L225 Difference]: With dead ends: 9235 [2018-11-18 18:03:26,071 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 18:03:26,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-18 18:03:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 18:03:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 18:03:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 18:03:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 18:03:26,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2018-11-18 18:03:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 18:03:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 18:03:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 18:03:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 18:03:26,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 18:03:26,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 18:03:26,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,821 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 466 DAG size of output: 348 [2018-11-18 18:03:26,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:26,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 18:03:27,280 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 330 [2018-11-18 18:03:29,020 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 255 DAG size of output: 104 [2018-11-18 18:03:30,060 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 335 DAG size of output: 94 [2018-11-18 18:03:31,069 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 321 DAG size of output: 94 [2018-11-18 18:03:31,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 18:03:31,070 INFO L421 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-11-18 18:03:31,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-18 18:03:31,071 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-18 18:03:31,072 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,073 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,074 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,075 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-18 18:03:31,076 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-18 18:03:31,077 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-18 18:03:31,078 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse15 (= 1 ~a21~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse14 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse16 (<= |old(~a8~0)| ~a8~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse19 (= 1 |old(~a17~0)|)) (.cse25 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse25)) (.cse24 (not (= 13 |old(~a8~0)|))) (.cse9 (not .cse19)) (.cse26 (< |old(~a20~0)| 1)) (.cse22 (< 0 |old(~a21~0)|)) (.cse21 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse14 .cse5 .cse7 .cse16 .cse8)) (.cse30 (< |old(~a8~0)| 15)) (.cse28 (< |old(~a8~0)| 14)) (.cse29 (and .cse4 .cse14 .cse5 .cse7 .cse16 .cse15 .cse8)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse17 (= ~a20~0 1)) (.cse12 (= |calculate_output_#in~input| 0)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse27 (= 6 |old(~a16~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse18 (and .cse4 .cse14 .cse5 .cse6 .cse7 .cse8)) (.cse3 (not (= 8 ~a12~0))) (.cse20 (< 14 |old(~a8~0)|)) (.cse23 (< 0 |old(~a20~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 .cse3 .cse19 .cse20) (or .cse21 (< 4 |old(~a16~0)|) .cse3 .cse20 .cse22 .cse23) (or .cse0 .cse18 .cse2 .cse3 .cse19 .cse20 .cse23) (or .cse11 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) .cse15) .cse24 .cse9) (or .cse0 .cse25 .cse1 .cse18 .cse3 .cse20) (or .cse0 .cse25 .cse3 .cse26 .cse19 .cse20 .cse18) (or .cse27 .cse11 .cse25 .cse28 .cse29 .cse3 .cse19 .cse20) (or .cse11 .cse29 (or .cse0 .cse25 .cse1 .cse3 .cse19) .cse30) (or .cse11 .cse1 .cse2 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse4 (= 1 ~a17~0)) .cse3 (not .cse0) .cse24 .cse9) (or .cse25 .cse3 .cse26 .cse19 .cse20 .cse22 .cse21) (or (or .cse10 .cse11 .cse13 .cse3 .cse12 .cse23) .cse29) (or (or .cse27 .cse1 .cse3 .cse22) .cse21 .cse20) (or .cse27 .cse11 .cse0 .cse3 .cse29 .cse30 .cse23) (or .cse27 .cse11 .cse28 .cse29 .cse3 .cse19 .cse23) (or .cse10 .cse11 (and .cse4 .cse14 .cse15 .cse5 .cse7 .cse16 .cse17) .cse3 .cse12 .cse1 .cse13 .cse19) (or .cse27 .cse0 .cse25 .cse18 .cse3 .cse20 .cse23)))) [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,079 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-18 18:03:31,080 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-18 18:03:31,081 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-18 18:03:31,082 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L421 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-11-18 18:03:31,083 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 18:03:31,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 18:03:31,083 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 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-11-18 18:03:31,084 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-18 18:03:31,084 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse10 (<= ~a8~0 |old(~a8~0)|)) (.cse11 (= ~a7~0 |old(~a7~0)|)) (.cse12 (= ~a20~0 |old(~a20~0)|)) (.cse9 (not (= main_~input~0 0))) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse13 (= 4 ~a16~0)) (.cse15 (= 1 ~a17~0)) (.cse14 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse8 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse17 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and (and (and .cse8 .cse1 .cse5) .cse7) .cse4) (and .cse9 .cse3 .cse10 .cse11 .cse2 .cse12) (and (and (and .cse8 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and .cse9 .cse10 .cse11 .cse2 .cse12 (= ~a16~0 5)) (and (and .cse8 .cse13 .cse3 .cse7) .cse4) (and (= ~a7~0 0) .cse9 (= ~a8~0 15) (= ~a21~0 1) .cse7) (and .cse14 (= 13 ~a8~0) .cse13 .cse2 .cse15) (and .cse8 .cse16 .cse4) (and (and (and .cse8 .cse3 .cse5) .cse14) .cse2) (and .cse8 .cse16 .cse13 .cse15) (and .cse4 (and .cse6 .cse14 .cse1)) (and .cse6 .cse3 .cse4 .cse17 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse8 .cse3 .cse5 .cse17) .cse4))) [2018-11-18 18:03:31,084 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-18 18:03:31,084 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-18 18:03:31,084 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-18 18:03:31,084 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse8 (<= ~a8~0 |old(~a8~0)|)) (.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse10 (= ~a20~0 |old(~a20~0)|)) (.cse0 (<= 14 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse15 (= |old(~a20~0)| ~a20~0)) (.cse12 (= 4 ~a16~0)) (.cse14 (= 1 ~a17~0)) (.cse13 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse11 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse16 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and .cse8 .cse9 .cse2 .cse10 (= ~a16~0 5)) (and (and (and .cse11 .cse1 .cse5) .cse7) .cse4) (and (not (= main_~input~0 0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and (and (and .cse11 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and (and (= ~a7~0 0) (= ~a8~0 15) .cse7) .cse2) (and (and .cse11 .cse12 .cse3 .cse7) .cse4) (and .cse13 (= 13 ~a8~0) .cse12 .cse2 .cse14) (and .cse11 .cse15 .cse4) (and (and (and .cse11 .cse3 .cse5) .cse13) .cse2) (and .cse11 .cse15 .cse12 .cse14) (and .cse4 (and .cse6 .cse13 .cse1)) (and .cse6 .cse3 .cse4 .cse16 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse11 .cse3 .cse5 .cse16) .cse4))) [2018-11-18 18:03:31,084 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-18 18:03:31,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:03:31 BoogieIcfgContainer [2018-11-18 18:03:31,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 18:03:31,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 18:03:31,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 18:03:31,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 18:03:31,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:02:54" (3/4) ... [2018-11-18 18:03:31,100 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 18:03:31,105 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 18:03:31,105 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 18:03:31,106 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 18:03:31,115 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 18:03:31,115 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 18:03:31,139 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((a8 <= \old(a8) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || (((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 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)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || (((!(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))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14) [2018-11-18 18:03:31,203 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_483f3865-a704-4191-b275-e8d030b8c3ee/bin-2019/utaipan/witness.graphml [2018-11-18 18:03:31,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 18:03:31,203 INFO L168 Benchmark]: Toolchain (without parser) took 38122.52 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 957.6 MB in the beginning and 1.5 GB in the end (delta: -541.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,204 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 18:03:31,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.13 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 921.6 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,205 INFO L168 Benchmark]: Boogie Preprocessor took 54.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,205 INFO L168 Benchmark]: RCFGBuilder took 839.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,205 INFO L168 Benchmark]: TraceAbstraction took 36693.92 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -518.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,205 INFO L168 Benchmark]: Witness Printer took 106.28 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-18 18:03:31,207 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.13 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 921.6 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.30 ms. Allocated memory is still 1.2 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 839.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36693.92 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -518.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 106.28 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.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)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((a8 <= \old(a8) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || (((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 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)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || (((!(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))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 36.6s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2045 SDtfs, 15654 SDslu, 3524 SDs, 0 SdLazy, 20296 SolverSat, 3023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4196 GetRequests, 3936 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9269occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9973972251122095 AbsIntWeakeningRatio, 0.20662983425414364 AbsIntAvgWeakeningVarsNumRemoved, 28.644198895027625 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 3837 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 411 PreInvPairs, 541 NumberOfFragments, 1496 HoareAnnotationTreeSize, 411 FomulaSimplifications, 59969 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 58202 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4707 NumberOfCodeBlocks, 4707 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3177349 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4010 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5362/5781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...