./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:35:05,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:35:05,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:35:05,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:35:05,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:35:05,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:35:05,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:35:05,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:35:05,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:35:05,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:35:05,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:35:05,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:35:05,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:35:05,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:35:05,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:35:05,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:35:05,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:35:05,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:35:05,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:35:05,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:35:05,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:35:05,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:35:05,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:35:05,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:35:05,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:35:05,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:35:05,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:35:05,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:35:05,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:35:05,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:35:05,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:35:05,408 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:35:05,408 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:35:05,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:35:05,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:35:05,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:35:05,410 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:35:05,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:35:05,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:35:05,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:35:05,418 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:35:05,418 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:35:05,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:35:05,418 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:35:05,418 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:35:05,419 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:35:05,419 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:35:05,419 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:35:05,419 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:35:05,419 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:35:05,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:35:05,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:35:05,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:35:05,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:35:05,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:35:05,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:35:05,423 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_a34791af-9261-4fef-a32d-feb2d6987529/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2018-12-09 00:35:05,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:35:05,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:35:05,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:35:05,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:35:05,450 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:35:05,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-12-09 00:35:05,488 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/data/e189a5ca5/c6f0263a4c444725a4979d13d1dadfc0/FLAG66603a654 [2018-12-09 00:35:05,888 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:35:05,888 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-12-09 00:35:05,895 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/data/e189a5ca5/c6f0263a4c444725a4979d13d1dadfc0/FLAG66603a654 [2018-12-09 00:35:06,230 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/data/e189a5ca5/c6f0263a4c444725a4979d13d1dadfc0 [2018-12-09 00:35:06,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:35:06,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:35:06,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:35:06,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:35:06,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:35:06,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c562b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06, skipping insertion in model container [2018-12-09 00:35:06,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:35:06,288 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:35:06,466 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:35:06,469 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:35:06,527 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:35:06,594 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:35:06,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06 WrapperNode [2018-12-09 00:35:06,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:35:06,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:35:06,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:35:06,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:35:06,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:35:06,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:35:06,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:35:06,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:35:06,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... [2018-12-09 00:35:06,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:35:06,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:35:06,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:35:06,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:35:06,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:35:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:35:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:35:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 00:35:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 00:35:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:35:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:35:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:35:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:35:07,194 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:35:07,194 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:35:07,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:07 BoogieIcfgContainer [2018-12-09 00:35:07,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:35:07,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:35:07,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:35:07,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:35:07,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:35:06" (1/3) ... [2018-12-09 00:35:07,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fa6772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:35:07, skipping insertion in model container [2018-12-09 00:35:07,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:35:06" (2/3) ... [2018-12-09 00:35:07,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fa6772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:35:07, skipping insertion in model container [2018-12-09 00:35:07,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:07" (3/3) ... [2018-12-09 00:35:07,199 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-12-09 00:35:07,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:35:07,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:35:07,219 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:35:07,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:35:07,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:35:07,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:35:07,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:35:07,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:35:07,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:35:07,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:35:07,240 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:35:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-09 00:35:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 00:35:07,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:07,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:07,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:07,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1121979298, now seen corresponding path program 1 times [2018-12-09 00:35:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:07,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:07,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:07,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:35:07,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:07,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:35:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:35:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:35:07,542 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-09 00:35:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:07,966 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-09 00:35:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:35:07,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-12-09 00:35:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:07,976 INFO L225 Difference]: With dead ends: 618 [2018-12-09 00:35:07,976 INFO L226 Difference]: Without dead ends: 320 [2018-12-09 00:35:07,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:35:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-09 00:35:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-09 00:35:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-09 00:35:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-09 00:35:08,016 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 146 [2018-12-09 00:35:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:08,016 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-09 00:35:08,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:35:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-09 00:35:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 00:35:08,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:08,019 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:08,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -74166087, now seen corresponding path program 1 times [2018-12-09 00:35:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:35:08,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:35:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:35:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:08,185 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2018-12-09 00:35:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:08,510 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2018-12-09 00:35:08,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:35:08,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2018-12-09 00:35:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:08,512 INFO L225 Difference]: With dead ends: 721 [2018-12-09 00:35:08,512 INFO L226 Difference]: Without dead ends: 320 [2018-12-09 00:35:08,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-09 00:35:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-09 00:35:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-09 00:35:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2018-12-09 00:35:08,523 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 154 [2018-12-09 00:35:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:08,523 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2018-12-09 00:35:08,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:35:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2018-12-09 00:35:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 00:35:08,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:08,525 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:08,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:08,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash 742954861, now seen corresponding path program 1 times [2018-12-09 00:35:08,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:08,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:35:08,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:08,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:35:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:35:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:08,669 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2018-12-09 00:35:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:08,977 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2018-12-09 00:35:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:35:08,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-12-09 00:35:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:08,979 INFO L225 Difference]: With dead ends: 717 [2018-12-09 00:35:08,979 INFO L226 Difference]: Without dead ends: 320 [2018-12-09 00:35:08,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-09 00:35:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-09 00:35:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-09 00:35:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2018-12-09 00:35:08,990 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 160 [2018-12-09 00:35:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:08,990 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2018-12-09 00:35:08,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:35:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2018-12-09 00:35:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 00:35:08,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:08,992 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:08,992 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:08,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:08,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1806866058, now seen corresponding path program 1 times [2018-12-09 00:35:08,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:08,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:08,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:08,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:09,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:09,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:35:09,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:09,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:35:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:35:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:35:09,085 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2018-12-09 00:35:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:09,523 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2018-12-09 00:35:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:35:09,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-12-09 00:35:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:09,525 INFO L225 Difference]: With dead ends: 951 [2018-12-09 00:35:09,525 INFO L226 Difference]: Without dead ends: 637 [2018-12-09 00:35:09,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:35:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-09 00:35:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2018-12-09 00:35:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-09 00:35:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2018-12-09 00:35:09,539 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 168 [2018-12-09 00:35:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:09,539 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2018-12-09 00:35:09,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:35:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2018-12-09 00:35:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 00:35:09,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:09,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:09,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:09,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1446244430, now seen corresponding path program 1 times [2018-12-09 00:35:09,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:09,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:09,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:09,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:35:09,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:09,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:35:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:35:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:09,638 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2018-12-09 00:35:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:09,972 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2018-12-09 00:35:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:35:09,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-12-09 00:35:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:09,975 INFO L225 Difference]: With dead ends: 1330 [2018-12-09 00:35:09,975 INFO L226 Difference]: Without dead ends: 626 [2018-12-09 00:35:09,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-09 00:35:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-09 00:35:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-09 00:35:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2018-12-09 00:35:09,994 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 170 [2018-12-09 00:35:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:09,994 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2018-12-09 00:35:09,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:35:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2018-12-09 00:35:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 00:35:09,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:09,997 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:09,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:09,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1864889838, now seen corresponding path program 1 times [2018-12-09 00:35:09,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:10,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:10,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:35:10,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:10,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:35:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:35:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:10,099 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2018-12-09 00:35:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:10,485 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2018-12-09 00:35:10,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:35:10,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-12-09 00:35:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:10,488 INFO L225 Difference]: With dead ends: 1332 [2018-12-09 00:35:10,488 INFO L226 Difference]: Without dead ends: 626 [2018-12-09 00:35:10,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:35:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-09 00:35:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-09 00:35:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-09 00:35:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2018-12-09 00:35:10,505 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 172 [2018-12-09 00:35:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:10,505 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2018-12-09 00:35:10,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:35:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2018-12-09 00:35:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 00:35:10,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:10,508 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:10,508 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:10,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1412924006, now seen corresponding path program 1 times [2018-12-09 00:35:10,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:10,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:10,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:10,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:10,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:35:10,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:10,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:35:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:35:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:35:10,576 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2018-12-09 00:35:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:10,949 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2018-12-09 00:35:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:35:10,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-12-09 00:35:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:10,954 INFO L225 Difference]: With dead ends: 1858 [2018-12-09 00:35:10,955 INFO L226 Difference]: Without dead ends: 1238 [2018-12-09 00:35:10,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:35:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-12-09 00:35:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2018-12-09 00:35:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-09 00:35:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2018-12-09 00:35:10,985 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 176 [2018-12-09 00:35:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:10,985 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2018-12-09 00:35:10,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:35:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2018-12-09 00:35:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-09 00:35:10,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:10,989 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:10,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:10,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -788488225, now seen corresponding path program 1 times [2018-12-09 00:35:10,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:11,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:11,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:11,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-12-09 00:35:11,088 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:11,114 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:11,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:11,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:11,619 INFO L272 AbstractInterpreter]: Visited 151 different actions 446 times. Merged at 6 different actions 15 times. Never widened. Performed 5207 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5207 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:11,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:11,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:11,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:11,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:11,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:11,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:11,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:35:11,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:35:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:35:11,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-12-09 00:35:11,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:35:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:35:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:35:11,840 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2018-12-09 00:35:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:12,122 INFO L93 Difference]: Finished difference Result 3171 states and 4306 transitions. [2018-12-09 00:35:12,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:35:12,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-12-09 00:35:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:12,129 INFO L225 Difference]: With dead ends: 3171 [2018-12-09 00:35:12,129 INFO L226 Difference]: Without dead ends: 1959 [2018-12-09 00:35:12,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:35:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2018-12-09 00:35:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1959. [2018-12-09 00:35:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2018-12-09 00:35:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2496 transitions. [2018-12-09 00:35:12,167 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2496 transitions. Word has length 181 [2018-12-09 00:35:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:12,167 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2496 transitions. [2018-12-09 00:35:12,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:35:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2496 transitions. [2018-12-09 00:35:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 00:35:12,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:12,170 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:12,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1479656218, now seen corresponding path program 1 times [2018-12-09 00:35:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:12,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:12,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:12,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:12,242 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-12-09 00:35:12,242 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:12,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:12,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:12,433 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:35:12,434 INFO L272 AbstractInterpreter]: Visited 150 different actions 294 times. Merged at 4 different actions 4 times. Never widened. Performed 3255 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 00:35:12,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:12,435 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:35:12,696 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 82.92% of their original sizes. [2018-12-09 00:35:12,696 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:35:12,742 INFO L418 sIntCurrentIteration]: We unified 209 AI predicates to 209 [2018-12-09 00:35:12,742 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:35:12,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:35:12,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-09 00:35:12,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:12,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:35:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:35:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:35:12,744 INFO L87 Difference]: Start difference. First operand 1959 states and 2496 transitions. Second operand 10 states. [2018-12-09 00:35:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:15,528 INFO L93 Difference]: Finished difference Result 4660 states and 5971 transitions. [2018-12-09 00:35:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:35:15,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-12-09 00:35:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:15,533 INFO L225 Difference]: With dead ends: 4660 [2018-12-09 00:35:15,533 INFO L226 Difference]: Without dead ends: 2707 [2018-12-09 00:35:15,536 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:35:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2018-12-09 00:35:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2697. [2018-12-09 00:35:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2697 states. [2018-12-09 00:35:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3342 transitions. [2018-12-09 00:35:15,571 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3342 transitions. Word has length 210 [2018-12-09 00:35:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:15,571 INFO L480 AbstractCegarLoop]: Abstraction has 2697 states and 3342 transitions. [2018-12-09 00:35:15,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:35:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3342 transitions. [2018-12-09 00:35:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-09 00:35:15,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:15,574 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-12-09 00:35:15,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:15,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1161638674, now seen corresponding path program 1 times [2018-12-09 00:35:15,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:15,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:15,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:35:15,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:15,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:15,676 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-12-09 00:35:15,676 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:15,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:15,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:15,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:35:15,874 INFO L272 AbstractInterpreter]: Visited 150 different actions 445 times. Merged at 6 different actions 15 times. Never widened. Performed 5039 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5039 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:15,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:15,876 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:35:16,062 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 84.87% of their original sizes. [2018-12-09 00:35:16,062 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:35:16,102 INFO L418 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2018-12-09 00:35:16,102 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:35:16,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:35:16,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-12-09 00:35:16,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:35:16,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:35:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:35:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:35:16,103 INFO L87 Difference]: Start difference. First operand 2697 states and 3342 transitions. Second operand 10 states. [2018-12-09 00:35:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:18,028 INFO L93 Difference]: Finished difference Result 7058 states and 8933 transitions. [2018-12-09 00:35:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 00:35:18,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2018-12-09 00:35:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:18,036 INFO L225 Difference]: With dead ends: 7058 [2018-12-09 00:35:18,036 INFO L226 Difference]: Without dead ends: 4367 [2018-12-09 00:35:18,039 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:35:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2018-12-09 00:35:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 4049. [2018-12-09 00:35:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-12-09 00:35:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 4986 transitions. [2018-12-09 00:35:18,092 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 4986 transitions. Word has length 228 [2018-12-09 00:35:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:18,092 INFO L480 AbstractCegarLoop]: Abstraction has 4049 states and 4986 transitions. [2018-12-09 00:35:18,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:35:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 4986 transitions. [2018-12-09 00:35:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-09 00:35:18,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:18,097 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:18,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:18,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -499769692, now seen corresponding path program 1 times [2018-12-09 00:35:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:18,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:18,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 116 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:18,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:18,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:18,219 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-12-09 00:35:18,219 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:18,221 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:18,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:18,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:18,400 INFO L272 AbstractInterpreter]: Visited 154 different actions 453 times. Merged at 7 different actions 17 times. Never widened. Performed 5263 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:18,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:18,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:18,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:18,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:18,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:35:18,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:35:18,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:35:18,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-12-09 00:35:18,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:35:18,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 00:35:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 00:35:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:35:18,636 INFO L87 Difference]: Start difference. First operand 4049 states and 4986 transitions. Second operand 15 states. [2018-12-09 00:35:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:19,789 INFO L93 Difference]: Finished difference Result 8262 states and 10194 transitions. [2018-12-09 00:35:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:35:19,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 251 [2018-12-09 00:35:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:19,795 INFO L225 Difference]: With dead ends: 8262 [2018-12-09 00:35:19,795 INFO L226 Difference]: Without dead ends: 3927 [2018-12-09 00:35:19,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 509 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-12-09 00:35:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2018-12-09 00:35:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3763. [2018-12-09 00:35:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2018-12-09 00:35:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 4411 transitions. [2018-12-09 00:35:19,844 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 4411 transitions. Word has length 251 [2018-12-09 00:35:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 3763 states and 4411 transitions. [2018-12-09 00:35:19,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 00:35:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 4411 transitions. [2018-12-09 00:35:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-12-09 00:35:19,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:19,849 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:19,849 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:19,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1641491959, now seen corresponding path program 1 times [2018-12-09 00:35:19,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:19,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 247 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:20,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:20,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:20,012 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-12-09 00:35:20,012 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:20,014 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:20,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:20,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:20,278 INFO L272 AbstractInterpreter]: Visited 154 different actions 607 times. Merged at 7 different actions 28 times. Widened at 1 different actions 1 times. Performed 7076 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7076 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:20,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:20,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:20,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:20,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:20,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:20,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 00:35:20,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 00:35:20,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:35:20,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-12-09 00:35:20,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:35:20,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:35:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:35:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:35:20,646 INFO L87 Difference]: Start difference. First operand 3763 states and 4411 transitions. Second operand 13 states. [2018-12-09 00:35:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:22,558 INFO L93 Difference]: Finished difference Result 8302 states and 9794 transitions. [2018-12-09 00:35:22,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 00:35:22,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 309 [2018-12-09 00:35:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:22,565 INFO L225 Difference]: With dead ends: 8302 [2018-12-09 00:35:22,565 INFO L226 Difference]: Without dead ends: 4539 [2018-12-09 00:35:22,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 636 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 00:35:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2018-12-09 00:35:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4074. [2018-12-09 00:35:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2018-12-09 00:35:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 4491 transitions. [2018-12-09 00:35:22,619 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 4491 transitions. Word has length 309 [2018-12-09 00:35:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:22,619 INFO L480 AbstractCegarLoop]: Abstraction has 4074 states and 4491 transitions. [2018-12-09 00:35:22,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:35:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 4491 transitions. [2018-12-09 00:35:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-12-09 00:35:22,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:22,625 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:22,625 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1816964365, now seen corresponding path program 1 times [2018-12-09 00:35:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:22,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 291 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:35:23,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:23,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:23,117 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 345 with the following transitions: [2018-12-09 00:35:23,118 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:23,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:23,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:23,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:23,329 INFO L272 AbstractInterpreter]: Visited 154 different actions 601 times. Merged at 7 different actions 22 times. Never widened. Performed 6737 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6737 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-09 00:35:23,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:23,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:23,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:23,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:23,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:23,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 307 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-09 00:35:23,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 307 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-09 00:35:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:35:23,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 23 [2018-12-09 00:35:23,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:35:23,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 00:35:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 00:35:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:35:23,781 INFO L87 Difference]: Start difference. First operand 4074 states and 4491 transitions. Second operand 19 states. [2018-12-09 00:35:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:25,535 INFO L93 Difference]: Finished difference Result 8047 states and 8908 transitions. [2018-12-09 00:35:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 00:35:25,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 344 [2018-12-09 00:35:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:25,541 INFO L225 Difference]: With dead ends: 8047 [2018-12-09 00:35:25,541 INFO L226 Difference]: Without dead ends: 4405 [2018-12-09 00:35:25,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=1824, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 00:35:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2018-12-09 00:35:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4078. [2018-12-09 00:35:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2018-12-09 00:35:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 4453 transitions. [2018-12-09 00:35:25,598 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 4453 transitions. Word has length 344 [2018-12-09 00:35:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:25,598 INFO L480 AbstractCegarLoop]: Abstraction has 4078 states and 4453 transitions. [2018-12-09 00:35:25,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 00:35:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 4453 transitions. [2018-12-09 00:35:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-09 00:35:25,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:25,602 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:35:25,602 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:25,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1707995725, now seen corresponding path program 1 times [2018-12-09 00:35:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:25,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:25,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 255 proven. 19 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-09 00:35:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:25,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:25,685 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2018-12-09 00:35:25,685 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:25,686 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:25,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:25,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:25,933 INFO L272 AbstractInterpreter]: Visited 160 different actions 629 times. Merged at 9 different actions 34 times. Never widened. Performed 7191 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:25,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:25,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:25,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:25,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:25,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:25,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 307 proven. 2 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-12-09 00:35:26,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 255 proven. 19 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-09 00:35:26,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:35:26,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-12-09 00:35:26,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:35:26,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:35:26,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:35:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:35:26,193 INFO L87 Difference]: Start difference. First operand 4078 states and 4453 transitions. Second operand 7 states. [2018-12-09 00:35:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:26,476 INFO L93 Difference]: Finished difference Result 6075 states and 6636 transitions. [2018-12-09 00:35:26,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:35:26,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2018-12-09 00:35:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:26,481 INFO L225 Difference]: With dead ends: 6075 [2018-12-09 00:35:26,482 INFO L226 Difference]: Without dead ends: 3493 [2018-12-09 00:35:26,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 699 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:35:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3493 states. [2018-12-09 00:35:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3493 to 3459. [2018-12-09 00:35:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2018-12-09 00:35:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 3745 transitions. [2018-12-09 00:35:26,520 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 3745 transitions. Word has length 350 [2018-12-09 00:35:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 3745 transitions. [2018-12-09 00:35:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:35:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 3745 transitions. [2018-12-09 00:35:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-12-09 00:35:26,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:35:26,524 INFO L402 BasicCegarLoop]: trace histogram [5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 00:35:26,524 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:35:26,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash 724273390, now seen corresponding path program 1 times [2018-12-09 00:35:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:35:26,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:26,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:26,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:26,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:35:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 86 proven. 327 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 00:35:27,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:27,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:35:27,371 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2018-12-09 00:35:27,372 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 00:35:27,373 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:35:27,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:35:27,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:35:27,589 INFO L272 AbstractInterpreter]: Visited 157 different actions 619 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Performed 6866 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 00:35:27,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:27,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:35:27,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:27,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:35:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:27,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:35:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:27,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 345 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 00:35:27,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:35:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 345 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 00:35:27,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:35:27,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 5] total 29 [2018-12-09 00:35:27,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:35:27,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 00:35:27,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 00:35:27,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-12-09 00:35:27,895 INFO L87 Difference]: Start difference. First operand 3459 states and 3745 transitions. Second operand 27 states. [2018-12-09 00:35:32,376 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-12-09 00:35:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:34,931 INFO L93 Difference]: Finished difference Result 6653 states and 7289 transitions. [2018-12-09 00:35:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-09 00:35:34,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 365 [2018-12-09 00:35:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:35:34,931 INFO L225 Difference]: With dead ends: 6653 [2018-12-09 00:35:34,931 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:35:34,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 750 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1115, Invalid=4435, Unknown=0, NotChecked=0, Total=5550 [2018-12-09 00:35:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:35:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:35:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:35:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:35:34,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2018-12-09 00:35:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:35:34,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:35:34,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 00:35:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:35:34,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:35:34,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:35:35,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,173 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 172 [2018-12-09 00:35:35,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:35,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:35:36,285 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 111 [2018-12-09 00:35:36,770 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 77 [2018-12-09 00:35:37,323 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 83 [2018-12-09 00:35:37,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:35:37,325 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-12-09 00:35:37,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-12-09 00:35:37,326 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-12-09 00:35:37,327 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-12-09 00:35:37,328 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-12-09 00:35:37,329 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-12-09 00:35:37,330 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-12-09 00:35:37,331 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-12-09 00:35:37,332 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-12-09 00:35:37,333 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= 1 |old(~a19~0)|)) (.cse4 (= 1 |old(~a25~0)|))) (let ((.cse8 (= |old(~a11~0)| ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse12 (= ~a28~0 |old(~a28~0)|)) (.cse24 (= ~a25~0 |old(~a25~0)|)) (.cse2 (= 1 |old(~a11~0)|)) (.cse14 (not .cse4)) (.cse0 (not (= 1 ~a21~0))) (.cse21 (not .cse15)) (.cse28 (= 0 |old(~a28~0)|)) (.cse31 (= 9 |old(~a28~0)|)) (.cse5 (not (= 8 |old(~a17~0)|))) (.cse25 (= |calculate_output_#in~input| 0)) (.cse27 (= |old(~a17~0)| |old(~a28~0)|))) (let ((.cse13 (not (= 10 |old(~a28~0)|))) (.cse7 (let ((.cse32 (< 10 |old(~a28~0)|))) (and (or .cse32 .cse0 .cse2 .cse14 .cse21 .cse28 .cse27 .cse5 .cse25) (or .cse32 .cse14 (or .cse0 .cse21 .cse28 .cse31 .cse5 .cse25) .cse27)))) (.cse22 (= |old(~a28~0)| ~a28~0)) (.cse23 (= ~a17~0 8)) (.cse26 (and (or .cse0 (not (= 11 |old(~a28~0)|)) .cse14 .cse21 .cse5) (or .cse0 .cse21 .cse28 .cse5 (not (= 0 |old(~a25~0)|))))) (.cse3 (< 0 |old(~a19~0)|)) (.cse9 (= 1 ~a25~0)) (.cse1 (not (= 7 |old(~a28~0)|))) (.cse19 (not .cse2)) (.cse16 (= 7 ~a28~0)) (.cse17 (= 1 ~a11~0)) (.cse29 (= 7 ~a17~0)) (.cse18 (= 1 ~a19~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse30 (not (= 7 |old(~a17~0)|))) (.cse6 (and .cse8 .cse10 .cse11 .cse12 .cse24))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse2 (and .cse8 .cse9 .cse10 .cse11 .cse12)) (or .cse0 .cse2 .cse13 .cse14 .cse6 .cse5 .cse3) (or .cse15 .cse0 .cse1 .cse5 (and .cse16 (not (= ~a25~0 1)) .cse17 .cse10 (not .cse18)) .cse19 .cse4) (or (and .cse17 .cse10 .cse18 .cse20 (= 10 ~a28~0)) .cse0 .cse13 .cse14 .cse21 .cse5 .cse19) (or (and (and .cse8 (and .cse22 .cse23 .cse24)) .cse11) (and (or (or .cse25 .cse26 .cse4) .cse27) (or .cse0 .cse2 .cse21 .cse28 .cse27 .cse5 .cse25 .cse4))) (or .cse7 .cse1 (and .cse8 (and .cse23 (= ~a19~0 1) .cse24) .cse12)) (or .cse0 .cse27 .cse3 (and .cse22 (<= ~a19~0 0) .cse29 .cse20) .cse30) (or (and .cse8 .cse23 .cse11 .cse12 .cse24) .cse2 .cse27 .cse25 .cse26) (or .cse0 .cse2 (not (= 8 |old(~a28~0)|)) .cse5 .cse3 .cse6 .cse4) (or .cse0 .cse14 .cse21 .cse5 (and .cse17 .cse9 (= 9 ~a28~0) .cse10 .cse18) (not .cse31) .cse19) (or .cse0 .cse1 .cse14 .cse21 .cse19 (and .cse16 .cse17 .cse29 .cse18 .cse20) .cse30) (or .cse0 .cse2 (< 8 |old(~a28~0)|) .cse14 .cse21 .cse6 .cse5))))) [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,334 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-12-09 00:35:37,335 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-12-09 00:35:37,336 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-12-09 00:35:37,337 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:35:37,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:35:37,337 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a25~0 |old(~a25~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-12-09 00:35:37,338 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse16 (not (= ~a28~0 0))) (.cse10 (= ~a17~0 8)) (.cse11 (= ~a19~0 1)) (.cse12 (= ~a25~0 1)) (.cse4 (= 1 ~a25~0))) (let ((.cse8 (= 7 ~a17~0)) (.cse0 (<= ~a19~0 0)) (.cse2 (not .cse4)) (.cse1 (= 7 ~a28~0)) (.cse7 (= 1 ~a11~0)) (.cse3 (= 8 ~a17~0)) (.cse5 (= 10 ~a28~0)) (.cse9 (= 1 ~a19~0)) (.cse6 (not (= ~a11~0 1))) (.cse13 (not (= ~a28~0 ~a17~0))) (.cse15 (not .cse12)) (.cse14 (let ((.cse17 (= ~a21~0 1))) (or (and (= ~a28~0 11) .cse10 .cse11 .cse17 .cse12) (and (= ~a25~0 0) .cse16 .cse10 .cse11 .cse17))))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse7 .cse8 .cse4 .cse9) (and .cse4 (= 9 ~a28~0) .cse3 .cse9) (and (and .cse10 .cse11 .cse12) (= ~a28~0 7)) (and .cse0 .cse13 .cse8) (not (= 1 |old(~a19~0)|)) (and (and .cse6 .cse14) .cse4) (not (= 7 |old(~a28~0)|)) (and .cse0 .cse6 (= 8 ~a28~0) .cse2 .cse3) (and .cse1 .cse15 .cse7 .cse3 (not .cse9)) (and .cse12 .cse6 (<= ~a28~0 8) .cse3 .cse9) (not (= 0 |old(~a25~0)|)) (and .cse4 .cse5 .cse10 .cse9) (or (and .cse13 .cse16 .cse15 .cse10 .cse11 .cse6) (and .cse13 .cse15 .cse14)) (not (= |old(~a17~0)| 8))))) [2018-12-09 00:35:37,338 INFO L448 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2018-12-09 00:35:37,338 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-12-09 00:35:37,338 INFO L444 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse12 (not (= ~a28~0 0))) (.cse14 (= ~a17~0 8)) (.cse17 (= ~a19~0 1)) (.cse16 (= ~a25~0 1)) (.cse4 (= 1 ~a25~0))) (let ((.cse8 (= 7 ~a17~0)) (.cse5 (= 10 ~a28~0)) (.cse0 (<= ~a19~0 0)) (.cse2 (not .cse4)) (.cse1 (= 7 ~a28~0)) (.cse13 (not .cse16)) (.cse3 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0)) (.cse6 (not (= ~a11~0 1))) (.cse15 (let ((.cse18 (= ~a21~0 1))) (or (and (= ~a28~0 11) .cse14 .cse17 .cse18 .cse16) (and (= ~a25~0 0) .cse12 .cse14 .cse17 .cse18)))) (.cse7 (= 1 ~a11~0)) (.cse11 (not (= main_~input~0 0))) (.cse10 (not (= ~a28~0 ~a17~0)))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse7 .cse8 .cse4 .cse9) (and .cse7 .cse4 (= 9 ~a28~0) .cse3 .cse9) (and .cse0 .cse10 .cse8) (not (= 1 |old(~a19~0)|)) (and .cse7 .cse4 .cse3 .cse9 .cse5) (and (or (and .cse11 .cse10 .cse12 .cse13 .cse14 .cse6) (and .cse11 .cse10 .cse13 .cse15)) .cse9) (not (= 7 |old(~a28~0)|)) (and .cse0 .cse6 (= 8 ~a28~0) .cse2 .cse3) (and .cse1 .cse13 .cse7 .cse3 (not .cse9)) (and .cse16 .cse6 (<= ~a28~0 8) .cse3 .cse9) (and .cse11 .cse10 .cse6 .cse15) (and .cse11 .cse16 (= |old(~a28~0)| ~a28~0) .cse14 .cse17) (not (= 0 |old(~a25~0)|)) (and (not .cse7) (and .cse11 (<= ~a28~0 10) .cse10 .cse12 .cse14 .cse17)) (not (= |old(~a17~0)| 8))))) [2018-12-09 00:35:37,338 INFO L448 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-12-09 00:35:37,338 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-12-09 00:35:37,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:35:37 BoogieIcfgContainer [2018-12-09 00:35:37,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:35:37,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:35:37,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:35:37,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:35:37,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:35:07" (3/4) ... [2018-12-09 00:35:37,354 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:35:37,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:35:37,359 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-09 00:35:37,360 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:35:37,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 00:35:37,369 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 00:35:37,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(1 == a21) || (((a19 <= 0 && 7 == a28) && !(1 == a25)) && 8 == a17)) || !(0 == \old(a11))) || ((((a19 <= 0 && 1 == a25) && 10 == a28) && !(a11 == 1)) && 8 == a17)) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || (((1 == a25 && 9 == a28) && 8 == a17) && 1 == a19)) || (((a17 == 8 && a19 == 1) && a25 == 1) && a28 == 7)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || !(1 == \old(a19))) || ((!(a11 == 1) && (((((a28 == 11 && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) || ((((a25 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) && a21 == 1))) && 1 == a25)) || !(7 == \old(a28))) || ((((a19 <= 0 && !(a11 == 1)) && 8 == a28) && !(1 == a25)) && 8 == a17)) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || ((((a25 == 1 && !(a11 == 1)) && a28 <= 8) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((1 == a25 && 10 == a28) && a17 == 8) && 1 == a19)) || (((((!(a28 == a17) && !(a28 == 0)) && !(a25 == 1)) && a17 == 8) && a19 == 1) && !(a11 == 1)) || ((!(a28 == a17) && !(a25 == 1)) && (((((a28 == 11 && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) || ((((a25 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) && a21 == 1)))) || !(\old(a17) == 8) [2018-12-09 00:35:37,453 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a34791af-9261-4fef-a32d-feb2d6987529/bin-2019/utaipan/witness.graphml [2018-12-09 00:35:37,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:35:37,454 INFO L168 Benchmark]: Toolchain (without parser) took 31217.29 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 941.6 MB in the beginning and 1.4 GB in the end (delta: -418.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,454 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:35:37,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:35:37,455 INFO L168 Benchmark]: Boogie Preprocessor took 42.06 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,455 INFO L168 Benchmark]: RCFGBuilder took 535.63 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: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,455 INFO L168 Benchmark]: TraceAbstraction took 30155.16 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -384.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,455 INFO L168 Benchmark]: Witness Printer took 103.34 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:37,456 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.06 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 535.63 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: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30155.16 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -384.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 103.34 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == a21) || (((a19 <= 0 && 7 == a28) && !(1 == a25)) && 8 == a17)) || !(0 == \old(a11))) || ((((a19 <= 0 && 1 == a25) && 10 == a28) && !(a11 == 1)) && 8 == a17)) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || (((1 == a25 && 9 == a28) && 8 == a17) && 1 == a19)) || (((a17 == 8 && a19 == 1) && a25 == 1) && a28 == 7)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || !(1 == \old(a19))) || ((!(a11 == 1) && (((((a28 == 11 && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) || ((((a25 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) && a21 == 1))) && 1 == a25)) || !(7 == \old(a28))) || ((((a19 <= 0 && !(a11 == 1)) && 8 == a28) && !(1 == a25)) && 8 == a17)) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || ((((a25 == 1 && !(a11 == 1)) && a28 <= 8) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((1 == a25 && 10 == a28) && a17 == 8) && 1 == a19)) || (((((!(a28 == a17) && !(a28 == 0)) && !(a25 == 1)) && a17 == 8) && a19 == 1) && !(a11 == 1)) || ((!(a28 == a17) && !(a25 == 1)) && (((((a28 == 11 && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) || ((((a25 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) && a21 == 1)))) || !(\old(a17) == 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 30.1s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1106 SDtfs, 14901 SDslu, 1885 SDs, 0 SdLazy, 22800 SolverSat, 3130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 4372 GetRequests, 4088 SyntacticMatches, 22 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4078occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9978632246262226 AbsIntWeakeningRatio, 0.15137614678899083 AbsIntAvgWeakeningVarsNumRemoved, 26.174311926605505 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1349 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 218 PreInvPairs, 308 NumberOfFragments, 1398 HoareAnnotationTreeSize, 218 FomulaSimplifications, 17242 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14551 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 5184 NumberOfCodeBlocks, 5184 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6957 ConstructedInterpolants, 0 QuantifiedInterpolants, 11175067 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3687 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 4749/5362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...