./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label14_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_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/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 bf623cbfa27d5f25c20ae418fc6508fd949965cd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:36:58,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:36:58,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:36:58,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:36:58,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:36:58,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:36:58,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:36:58,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:36:58,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:36:58,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:36:58,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:36:58,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:36:58,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:36:58,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:36:58,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:36:58,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:36:58,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:36:58,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:36:58,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:36:58,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:36:58,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:36:58,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:36:58,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:36:58,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:36:58,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:36:58,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:36:58,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:36:58,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:36:58,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:36:58,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:36:58,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:36:58,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:36:58,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:36:58,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:36:58,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:36:58,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:36:58,568 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:36:58,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:36:58,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:36:58,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:36:58,575 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:36:58,575 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:36:58,575 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:36:58,576 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:36:58,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:36:58,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:36:58,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:36:58,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:36:58,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:36:58,579 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_85af5f6a-65a8-4141-8e6d-dc62eaebe970/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 -> bf623cbfa27d5f25c20ae418fc6508fd949965cd [2018-12-03 02:36:58,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:36:58,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:36:58,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:36:58,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:36:58,605 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:36:58,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 02:36:58,641 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/data/e6d23c2fa/4d764894a75c403cbff0d00cbd65fe70/FLAG4e17abd4f [2018-12-03 02:36:59,094 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:36:59,094 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 02:36:59,101 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/data/e6d23c2fa/4d764894a75c403cbff0d00cbd65fe70/FLAG4e17abd4f [2018-12-03 02:36:59,110 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/data/e6d23c2fa/4d764894a75c403cbff0d00cbd65fe70 [2018-12-03 02:36:59,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:36:59,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:36:59,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:36:59,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:36:59,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:36:59,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59, skipping insertion in model container [2018-12-03 02:36:59,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:36:59,147 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:36:59,323 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:36:59,327 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:36:59,431 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:36:59,445 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:36:59,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59 WrapperNode [2018-12-03 02:36:59,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:36:59,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:36:59,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:36:59,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:36:59,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:36:59,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:36:59,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:36:59,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:36:59,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... [2018-12-03 02:36:59,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:36:59,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:36:59,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:36:59,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:36:59,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/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-03 02:36:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:36:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:36:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-03 02:36:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-03 02:36:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:36:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:36:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:36:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:37:00,131 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:37:00,132 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 02:37:00,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:37:00 BoogieIcfgContainer [2018-12-03 02:37:00,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:37:00,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:37:00,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:37:00,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:37:00,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:36:59" (1/3) ... [2018-12-03 02:37:00,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:37:00, skipping insertion in model container [2018-12-03 02:37:00,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:36:59" (2/3) ... [2018-12-03 02:37:00,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:37:00, skipping insertion in model container [2018-12-03 02:37:00,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:37:00" (3/3) ... [2018-12-03 02:37:00,138 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 02:37:00,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:37:00,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:37:00,165 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:37:00,191 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:37:00,192 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:37:00,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:37:00,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:37:00,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:37:00,192 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:37:00,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:37:00,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:37:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-03 02:37:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 02:37:00,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:00,220 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] [2018-12-03 02:37:00,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:00,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -871643495, now seen corresponding path program 1 times [2018-12-03 02:37:00,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:00,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:00,469 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-03 02:37:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:37:00,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:37:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:37:00,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:37:00,484 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-03 02:37:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:00,886 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-03 02:37:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:37:00,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-03 02:37:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:00,895 INFO L225 Difference]: With dead ends: 618 [2018-12-03 02:37:00,895 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:37:00,898 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-03 02:37:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:37:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:37:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:37:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-03 02:37:00,936 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 123 [2018-12-03 02:37:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-03 02:37:00,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:37:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-03 02:37:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 02:37:00,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:00,941 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] [2018-12-03 02:37:00,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:00,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1344572258, now seen corresponding path program 1 times [2018-12-03 02:37:00,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:00,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:01,107 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-03 02:37:01,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:01,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:37:01,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:01,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:37:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:37:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:37:01,108 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2018-12-03 02:37:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:01,430 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2018-12-03 02:37:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:37:01,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2018-12-03 02:37:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:01,432 INFO L225 Difference]: With dead ends: 721 [2018-12-03 02:37:01,432 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:37:01,433 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-03 02:37:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:37:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:37:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:37:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2018-12-03 02:37:01,443 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 131 [2018-12-03 02:37:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:01,443 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2018-12-03 02:37:01,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:37:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2018-12-03 02:37:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 02:37:01,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:01,444 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] [2018-12-03 02:37:01,445 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:01,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1612994454, now seen corresponding path program 1 times [2018-12-03 02:37:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:01,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:01,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:01,597 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-03 02:37:01,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:01,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:37:01,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:01,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:37:01,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:37:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:37:01,598 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2018-12-03 02:37:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:01,892 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2018-12-03 02:37:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:37:01,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-12-03 02:37:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:01,894 INFO L225 Difference]: With dead ends: 717 [2018-12-03 02:37:01,894 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:37:01,894 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-03 02:37:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:37:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:37:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:37:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2018-12-03 02:37:01,902 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 137 [2018-12-03 02:37:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:01,902 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2018-12-03 02:37:01,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:37:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2018-12-03 02:37:01,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 02:37:01,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:01,903 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] [2018-12-03 02:37:01,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:01,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash -295293823, now seen corresponding path program 1 times [2018-12-03 02:37:01,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:01,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:01,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:01,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:01,954 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-03 02:37:01,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:01,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:37:01,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:01,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:37:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:37:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:37:01,956 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2018-12-03 02:37:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:02,357 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2018-12-03 02:37:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:37:02,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-12-03 02:37:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:02,359 INFO L225 Difference]: With dead ends: 951 [2018-12-03 02:37:02,359 INFO L226 Difference]: Without dead ends: 637 [2018-12-03 02:37:02,360 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-03 02:37:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-03 02:37:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2018-12-03 02:37:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:37:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2018-12-03 02:37:02,376 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 145 [2018-12-03 02:37:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:02,376 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2018-12-03 02:37:02,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:37:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2018-12-03 02:37:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 02:37:02,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:02,377 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] [2018-12-03 02:37:02,377 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:02,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1344349755, now seen corresponding path program 1 times [2018-12-03 02:37:02,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:02,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:02,483 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-03 02:37:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:37:02,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:02,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:37:02,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:37:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:37:02,484 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2018-12-03 02:37:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:02,796 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2018-12-03 02:37:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:37:02,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-12-03 02:37:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:02,798 INFO L225 Difference]: With dead ends: 1330 [2018-12-03 02:37:02,798 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 02:37:02,799 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-03 02:37:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 02:37:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 02:37:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:37:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2018-12-03 02:37:02,808 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 147 [2018-12-03 02:37:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:02,808 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2018-12-03 02:37:02,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:37:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2018-12-03 02:37:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 02:37:02,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:02,810 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] [2018-12-03 02:37:02,810 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:02,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2124265719, now seen corresponding path program 1 times [2018-12-03 02:37:02,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:02,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:02,897 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-03 02:37:02,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:02,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:37:02,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:02,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:37:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:37:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:37:02,898 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2018-12-03 02:37:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:03,247 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2018-12-03 02:37:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:37:03,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-12-03 02:37:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:03,249 INFO L225 Difference]: With dead ends: 1332 [2018-12-03 02:37:03,249 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 02:37:03,250 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-03 02:37:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 02:37:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 02:37:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:37:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2018-12-03 02:37:03,259 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 149 [2018-12-03 02:37:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:03,259 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2018-12-03 02:37:03,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:37:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2018-12-03 02:37:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 02:37:03,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:03,261 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] [2018-12-03 02:37:03,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:03,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 566845841, now seen corresponding path program 1 times [2018-12-03 02:37:03,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:03,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:03,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:03,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:03,308 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-03 02:37:03,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:37:03,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:37:03,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:03,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:37:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:37:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:37:03,310 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2018-12-03 02:37:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:03,673 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2018-12-03 02:37:03,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:37:03,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-12-03 02:37:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:03,678 INFO L225 Difference]: With dead ends: 1858 [2018-12-03 02:37:03,678 INFO L226 Difference]: Without dead ends: 1238 [2018-12-03 02:37:03,680 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-03 02:37:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-12-03 02:37:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2018-12-03 02:37:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-03 02:37:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2018-12-03 02:37:03,709 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 153 [2018-12-03 02:37:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:03,709 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2018-12-03 02:37:03,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:37:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2018-12-03 02:37:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 02:37:03,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:03,712 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] [2018-12-03 02:37:03,712 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:03,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1114474735, now seen corresponding path program 1 times [2018-12-03 02:37:03,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:03,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:03,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:03,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:03,768 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-03 02:37:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:37:03,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:37:03,769 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-03 02:37:03,770 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], [663], [665], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:37:03,796 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:37:03,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:37:04,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:37:04,163 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 times. Merged at 4 different actions 4 times. Never widened. Performed 2803 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2803 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-03 02:37:04,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:04,168 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:37:04,429 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 82.63% of their original sizes. [2018-12-03 02:37:04,429 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:37:04,480 INFO L418 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2018-12-03 02:37:04,480 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:37:04,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:37:04,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 02:37:04,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:04,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:37:04,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:37:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:37:04,481 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 10 states. [2018-12-03 02:37:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:07,352 INFO L93 Difference]: Finished difference Result 3178 states and 4247 transitions. [2018-12-03 02:37:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 02:37:07,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-12-03 02:37:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:07,356 INFO L225 Difference]: With dead ends: 3178 [2018-12-03 02:37:07,357 INFO L226 Difference]: Without dead ends: 1966 [2018-12-03 02:37:07,358 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 178 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-03 02:37:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2018-12-03 02:37:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1956. [2018-12-03 02:37:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-12-03 02:37:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2481 transitions. [2018-12-03 02:37:07,385 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2481 transitions. Word has length 187 [2018-12-03 02:37:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:07,385 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2481 transitions. [2018-12-03 02:37:07,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:37:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2481 transitions. [2018-12-03 02:37:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 02:37:07,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:07,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:37:07,389 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:07,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1692864608, now seen corresponding path program 1 times [2018-12-03 02:37:07,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:07,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:07,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:07,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:07,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:37:07,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:37:07,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:37:07,482 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-12-03 02:37:07,483 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], [119], [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], [663], [665], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:37:07,485 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:37:07,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:37:07,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:37:07,649 INFO L272 AbstractInterpreter]: Visited 129 different actions 382 times. Merged at 7 different actions 17 times. Never widened. Performed 4556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4556 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-03 02:37:07,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:07,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:37:07,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:37:07,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/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-03 02:37:07,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:07,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:37:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:07,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:37:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:37:07,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:37:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:37:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:37:07,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-12-03 02:37:07,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:37:07,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 02:37:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 02:37:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:37:07,888 INFO L87 Difference]: Start difference. First operand 1956 states and 2481 transitions. Second operand 14 states. [2018-12-03 02:37:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:09,359 INFO L93 Difference]: Finished difference Result 4947 states and 6363 transitions. [2018-12-03 02:37:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 02:37:09,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 191 [2018-12-03 02:37:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:09,364 INFO L225 Difference]: With dead ends: 4947 [2018-12-03 02:37:09,364 INFO L226 Difference]: Without dead ends: 2545 [2018-12-03 02:37:09,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 02:37:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2018-12-03 02:37:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2246. [2018-12-03 02:37:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-03 02:37:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2634 transitions. [2018-12-03 02:37:09,396 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2634 transitions. Word has length 191 [2018-12-03 02:37:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:09,397 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 2634 transitions. [2018-12-03 02:37:09,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 02:37:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2634 transitions. [2018-12-03 02:37:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 02:37:09,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:37:09,400 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, 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] [2018-12-03 02:37:09,400 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:37:09,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1309776120, now seen corresponding path program 1 times [2018-12-03 02:37:09,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:37:09,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:09,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:09,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:37:09,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:37:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:37:09,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:37:09,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:37:09,523 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-12-03 02:37:09,523 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], [313], [317], [321], [324], [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], [663], [665], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:37:09,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:37:09,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:37:09,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:37:09,683 INFO L272 AbstractInterpreter]: Visited 128 different actions 375 times. Merged at 6 different actions 13 times. Never widened. Performed 4509 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-03 02:37:09,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:37:09,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:37:09,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:37:09,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/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-03 02:37:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:37:09,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:37:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:37:09,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:37:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:37:09,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:37:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:37:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:37:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-12-03 02:37:09,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:37:09,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:37:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:37:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:37:09,799 INFO L87 Difference]: Start difference. First operand 2246 states and 2634 transitions. Second operand 3 states. [2018-12-03 02:37:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:37:10,015 INFO L93 Difference]: Finished difference Result 4343 states and 5126 transitions. [2018-12-03 02:37:10,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:37:10,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-12-03 02:37:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:37:10,016 INFO L225 Difference]: With dead ends: 4343 [2018-12-03 02:37:10,016 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:37:10,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:37:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:37:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:37:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:37:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:37:10,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208 [2018-12-03 02:37:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:37:10,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:37:10,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:37:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:37:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:37:10,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 02:37:10,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:37:10,615 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 82 [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,808 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-03 02:37:10,809 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-12-03 02:37:10,810 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,811 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,812 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-12-03 02:37:10,813 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-12-03 02:37:10,814 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse26 (= ~a25~0 1)) (.cse22 (= 1 |old(~a25~0)|)) (.cse24 (= 1 |old(~a19~0)|)) (.cse13 (= |old(~a17~0)| ~a17~0)) (.cse14 (= |old(~a25~0)| ~a25~0)) (.cse15 (= ~a28~0 |old(~a28~0)|)) (.cse11 (= 1 |old(~a11~0)|)) (.cse8 (= 1 ~a11~0)) (.cse9 (= 1 ~a19~0))) (let ((.cse0 (and .cse8 .cse9)) (.cse7 (not (= 7 |old(~a28~0)|))) (.cse6 (not .cse11)) (.cse10 (= 9 |old(~a28~0)|)) (.cse12 (not (= |old(~a17~0)| 8))) (.cse16 (not (= ~a11~0 1))) (.cse2 (not (= 10 |old(~a28~0)|))) (.cse23 (and .cse13 .cse14 .cse15)) (.cse21 (and (= ~a11~0 0) (= ~a19~0 1))) (.cse4 (not .cse24)) (.cse17 (= 0 |old(~a28~0)|)) (.cse19 (not (= 0 |old(~a11~0)|))) (.cse5 (not (= 8 |old(~a17~0)|))) (.cse20 (= |calculate_output_#in~input| 0)) (.cse1 (not (= 1 ~a21~0))) (.cse3 (not .cse22)) (.cse18 (= 8 |old(~a28~0)|)) (.cse25 (and .cse13 .cse15 .cse26)) (.cse27 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse4 .cse6 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse3 .cse4 .cse5 (and .cse8 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse9) (not .cse10) .cse6) (or .cse1 .cse11 .cse10 .cse12 (and .cse13 .cse14 .cse15 .cse16)) (or .cse1 .cse4 .cse17 .cse18 .cse19 .cse5 .cse20 .cse21) (or (or .cse1 .cse18 .cse12 .cse22) .cse23) (or .cse24 .cse1 .cse7 .cse5 (and .cse8 (not .cse9)) .cse6 .cse22) (or .cse3 (or .cse1 .cse18 .cse10 .cse12) .cse25) (or .cse1 .cse11 .cse3 .cse12 (and .cse13 .cse15 .cse26 .cse16)) (or .cse1 .cse2 .cse23 .cse27) (or .cse21 .cse1 .cse3 .cse4 .cse17 .cse19 .cse5 .cse20) (or .cse1 .cse3 .cse18 .cse25 .cse27)))) [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-12-03 02:37:10,815 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,816 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-12-03 02:37:10,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:37:10,817 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-03 02:37:10,818 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 02:37:10,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 02:37:10,818 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 (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-12-03 02:37:10,818 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 7)) (.cse3 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 (not (= ~a11~0 1))) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (= 10 ~a28~0)) (and .cse1 .cse2 .cse3) (not (= 1 |old(~a19~0)|)) (and (not .cse3) .cse0 .cse2) (not (= 8 |old(~a17~0)|)) (and .cse0 .cse2 (not (= ~a28~0 9))))) [2018-12-03 02:37:10,818 INFO L448 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2018-12-03 02:37:10,818 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-12-03 02:37:10,818 INFO L444 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 7)) (.cse3 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 (not (= ~a11~0 1))) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (= 10 ~a28~0)) (and .cse1 .cse2 .cse3) (not (= 1 |old(~a19~0)|)) (and (not .cse3) .cse0 .cse2) (not (= 8 |old(~a17~0)|)) (and .cse0 .cse2 (not (= ~a28~0 9))))) [2018-12-03 02:37:10,818 INFO L448 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-12-03 02:37:10,818 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-12-03 02:37:10,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:37:10 BoogieIcfgContainer [2018-12-03 02:37:10,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:37:10,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:37:10,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:37:10,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:37:10,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:37:00" (3/4) ... [2018-12-03 02:37:10,830 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 02:37:10,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 02:37:10,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-03 02:37:10,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 02:37:10,842 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-03 02:37:10,843 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 02:37:10,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (\old(a17) == a17 && !(a11 == 1))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (a17 <= 7 && 10 == a28)) || ((a17 <= 7 && !(a28 == 8)) && a25 == 1)) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9)) [2018-12-03 02:37:10,904 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85af5f6a-65a8-4141-8e6d-dc62eaebe970/bin-2019/utaipan/witness.graphml [2018-12-03 02:37:10,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:37:10,905 INFO L168 Benchmark]: Toolchain (without parser) took 11792.94 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 567.3 MB). Free memory was 942.7 MB in the beginning and 1.4 GB in the end (delta: -418.6 MB). Peak memory consumption was 148.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,905 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-03 02:37:10,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,906 INFO L168 Benchmark]: Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,906 INFO L168 Benchmark]: RCFGBuilder took 625.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,906 INFO L168 Benchmark]: TraceAbstraction took 10693.74 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 466.6 MB). Free memory was 975.8 MB in the beginning and 1.4 GB in the end (delta: -399.8 MB). Peak memory consumption was 535.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,906 INFO L168 Benchmark]: Witness Printer took 77.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:37:10,907 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 332.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 625.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10693.74 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 466.6 MB). Free memory was 975.8 MB in the beginning and 1.4 GB in the end (delta: -399.8 MB). Peak memory consumption was 535.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: 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) || !(7 == \old(a28))) || !(0 == \old(a11))) || (\old(a17) == a17 && !(a11 == 1))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (a17 <= 7 && 10 == a28)) || ((a17 <= 7 && !(a28 == 8)) && a25 == 1)) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 10.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 769 SDtfs, 5881 SDslu, 611 SDs, 0 SdLazy, 7559 SolverSat, 1408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1100 GetRequests, 1010 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2246occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9975387010016992 AbsIntWeakeningRatio, 0.1774193548387097 AbsIntAvgWeakeningVarsNumRemoved, 26.763440860215052 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 340 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 82 PreInvPairs, 126 NumberOfFragments, 609 HoareAnnotationTreeSize, 82 FomulaSimplifications, 1881 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2013 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1970 NumberOfCodeBlocks, 1970 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2355 ConstructedInterpolants, 0 QuantifiedInterpolants, 1866009 SizeOfPredicates, 1 NumberOfNonLiveVariables, 961 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 757/791 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...