./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/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 ede185df305af642a5265096891dc95893f4609c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:37:12,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:37:12,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:37:12,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:37:12,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:37:12,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:37:12,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:37:12,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:37:12,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:37:12,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:37:12,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:37:12,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:37:12,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:37:12,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:37:12,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:37:12,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:37:12,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:37:12,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:37:12,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:37:12,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:37:12,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:37:12,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:37:12,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:37:12,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:37:12,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:37:12,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:37:12,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:37:12,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:37:12,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:37:12,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:37:12,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:37:12,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:37:12,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:37:12,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:37:12,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:37:12,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:37:12,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:37:12,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:37:12,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:37:12,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:37:12,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:37:12,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:37:12,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:37:12,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:37:12,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:37:12,431 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:37:12,431 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:37:12,431 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:37:12,431 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:37:12,431 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:37:12,432 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:37:12,432 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:37:12,432 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:37:12,432 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:37:12,432 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:37:12,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:37:12,433 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:37:12,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:37:12,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:37:12,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:37:12,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:37:12,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:37:12,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:37:12,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:37:12,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:37:12,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:37:12,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:37:12,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:37:12,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:37:12,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:37:12,436 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:37:12,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:37:12,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:37:12,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:37:12,437 INFO L138 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/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/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 -> ede185df305af642a5265096891dc95893f4609c [2019-11-26 02:37:12,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:37:12,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:37:12,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:37:12,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:37:12,638 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:37:12,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c [2019-11-26 02:37:12,696 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/data/146556397/0b74510b7e984016af8ad3052faca53a/FLAG47f91a00e [2019-11-26 02:37:13,355 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:37:13,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/sv-benchmarks/c/psyco/psyco_accelerometer_1.c [2019-11-26 02:37:13,388 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/data/146556397/0b74510b7e984016af8ad3052faca53a/FLAG47f91a00e [2019-11-26 02:37:13,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/data/146556397/0b74510b7e984016af8ad3052faca53a [2019-11-26 02:37:13,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:37:13,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:37:13,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:13,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:37:13,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:37:13,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:13" (1/1) ... [2019-11-26 02:37:13,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144e8685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:13, skipping insertion in model container [2019-11-26 02:37:13,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:13" (1/1) ... [2019-11-26 02:37:13,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:37:13,848 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:37:14,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:14,674 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:37:14,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:14,947 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:37:14,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14 WrapperNode [2019-11-26 02:37:14,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:14,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:14,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:37:14,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:37:14,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:15,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:37:15,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:37:15,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:37:15,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... [2019-11-26 02:37:15,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:37:15,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:37:15,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:37:15,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:37:15,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/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 [2019-11-26 02:37:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:37:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:37:17,123 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:37:17,123 INFO L284 CfgBuilder]: Removed 25 assume(true) statements. [2019-11-26 02:37:17,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:17 BoogieIcfgContainer [2019-11-26 02:37:17,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:37:17,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:37:17,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:37:17,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:37:17,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:37:13" (1/3) ... [2019-11-26 02:37:17,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce64aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:37:17, skipping insertion in model container [2019-11-26 02:37:17,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:14" (2/3) ... [2019-11-26 02:37:17,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce64aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:37:17, skipping insertion in model container [2019-11-26 02:37:17,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:17" (3/3) ... [2019-11-26 02:37:17,133 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-11-26 02:37:17,141 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:37:17,147 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:37:17,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:37:17,187 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:37:17,187 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:37:17,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:37:17,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:37:17,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:37:17,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:37:17,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:37:17,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:37:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-11-26 02:37:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:37:17,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:17,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:17,219 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1038571567, now seen corresponding path program 1 times [2019-11-26 02:37:17,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:17,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831322500] [2019-11-26 02:37:17,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:17,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831322500] [2019-11-26 02:37:17,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:17,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:37:17,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280422188] [2019-11-26 02:37:17,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:37:17,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:37:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:37:17,405 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 2 states. [2019-11-26 02:37:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:17,461 INFO L93 Difference]: Finished difference Result 460 states and 907 transitions. [2019-11-26 02:37:17,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:37:17,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 02:37:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:17,484 INFO L225 Difference]: With dead ends: 460 [2019-11-26 02:37:17,484 INFO L226 Difference]: Without dead ends: 223 [2019-11-26 02:37:17,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:37:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-26 02:37:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-26 02:37:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-26 02:37:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 392 transitions. [2019-11-26 02:37:17,535 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 392 transitions. Word has length 8 [2019-11-26 02:37:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:17,536 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 392 transitions. [2019-11-26 02:37:17,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:37:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 392 transitions. [2019-11-26 02:37:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:37:17,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:17,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:17,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1598481019, now seen corresponding path program 1 times [2019-11-26 02:37:17,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:17,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992223809] [2019-11-26 02:37:17,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:17,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992223809] [2019-11-26 02:37:17,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:37:17,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525572623] [2019-11-26 02:37:17,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:17,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:17,599 INFO L87 Difference]: Start difference. First operand 223 states and 392 transitions. Second operand 3 states. [2019-11-26 02:37:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:17,801 INFO L93 Difference]: Finished difference Result 448 states and 787 transitions. [2019-11-26 02:37:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:17,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:37:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:17,804 INFO L225 Difference]: With dead ends: 448 [2019-11-26 02:37:17,804 INFO L226 Difference]: Without dead ends: 226 [2019-11-26 02:37:17,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-26 02:37:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-26 02:37:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-26 02:37:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 395 transitions. [2019-11-26 02:37:17,831 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 395 transitions. Word has length 9 [2019-11-26 02:37:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:17,831 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 395 transitions. [2019-11-26 02:37:17,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 395 transitions. [2019-11-26 02:37:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:37:17,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:17,832 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:17,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 74920244, now seen corresponding path program 1 times [2019-11-26 02:37:17,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:17,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488329633] [2019-11-26 02:37:17,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:17,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488329633] [2019-11-26 02:37:17,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:17,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:17,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408929415] [2019-11-26 02:37:17,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:17,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:17,913 INFO L87 Difference]: Start difference. First operand 226 states and 395 transitions. Second operand 3 states. [2019-11-26 02:37:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:18,044 INFO L93 Difference]: Finished difference Result 435 states and 768 transitions. [2019-11-26 02:37:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:18,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-26 02:37:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:18,047 INFO L225 Difference]: With dead ends: 435 [2019-11-26 02:37:18,047 INFO L226 Difference]: Without dead ends: 211 [2019-11-26 02:37:18,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-26 02:37:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-26 02:37:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-26 02:37:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 373 transitions. [2019-11-26 02:37:18,066 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 373 transitions. Word has length 14 [2019-11-26 02:37:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:18,067 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 373 transitions. [2019-11-26 02:37:18,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 373 transitions. [2019-11-26 02:37:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:37:18,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:18,068 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:18,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1876823746, now seen corresponding path program 1 times [2019-11-26 02:37:18,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:18,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643327375] [2019-11-26 02:37:18,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:18,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643327375] [2019-11-26 02:37:18,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:18,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:18,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101942406] [2019-11-26 02:37:18,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:18,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,143 INFO L87 Difference]: Start difference. First operand 211 states and 373 transitions. Second operand 3 states. [2019-11-26 02:37:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:18,458 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2019-11-26 02:37:18,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:18,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-26 02:37:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:18,462 INFO L225 Difference]: With dead ends: 613 [2019-11-26 02:37:18,462 INFO L226 Difference]: Without dead ends: 405 [2019-11-26 02:37:18,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-11-26 02:37:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 399. [2019-11-26 02:37:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-26 02:37:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 717 transitions. [2019-11-26 02:37:18,484 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 717 transitions. Word has length 17 [2019-11-26 02:37:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:18,485 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 717 transitions. [2019-11-26 02:37:18,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 717 transitions. [2019-11-26 02:37:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:37:18,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:18,486 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:18,487 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 652726930, now seen corresponding path program 1 times [2019-11-26 02:37:18,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:18,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986457138] [2019-11-26 02:37:18,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:18,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986457138] [2019-11-26 02:37:18,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:18,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:18,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786230610] [2019-11-26 02:37:18,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:18,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,526 INFO L87 Difference]: Start difference. First operand 399 states and 717 transitions. Second operand 3 states. [2019-11-26 02:37:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:18,651 INFO L93 Difference]: Finished difference Result 635 states and 1129 transitions. [2019-11-26 02:37:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:18,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:37:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:18,653 INFO L225 Difference]: With dead ends: 635 [2019-11-26 02:37:18,653 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:37:18,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:37:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-26 02:37:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-26 02:37:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 417 transitions. [2019-11-26 02:37:18,663 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 417 transitions. Word has length 18 [2019-11-26 02:37:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:18,664 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 417 transitions. [2019-11-26 02:37:18,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 417 transitions. [2019-11-26 02:37:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:37:18,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:18,668 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:18,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1936585951, now seen corresponding path program 1 times [2019-11-26 02:37:18,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:18,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322137591] [2019-11-26 02:37:18,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:18,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322137591] [2019-11-26 02:37:18,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:18,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:18,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720898165] [2019-11-26 02:37:18,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:18,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,728 INFO L87 Difference]: Start difference. First operand 241 states and 417 transitions. Second operand 3 states. [2019-11-26 02:37:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:18,876 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-26 02:37:18,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:18,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:37:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:18,878 INFO L225 Difference]: With dead ends: 243 [2019-11-26 02:37:18,878 INFO L226 Difference]: Without dead ends: 241 [2019-11-26 02:37:18,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-26 02:37:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-26 02:37:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-26 02:37:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 409 transitions. [2019-11-26 02:37:18,890 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 409 transitions. Word has length 18 [2019-11-26 02:37:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:18,895 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 409 transitions. [2019-11-26 02:37:18,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 409 transitions. [2019-11-26 02:37:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:37:18,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:18,896 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:18,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 865993251, now seen corresponding path program 1 times [2019-11-26 02:37:18,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:18,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607240041] [2019-11-26 02:37:18,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:19,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607240041] [2019-11-26 02:37:19,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:19,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:19,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899720972] [2019-11-26 02:37:19,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:19,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:19,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,039 INFO L87 Difference]: Start difference. First operand 241 states and 409 transitions. Second operand 3 states. [2019-11-26 02:37:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:19,583 INFO L93 Difference]: Finished difference Result 648 states and 1103 transitions. [2019-11-26 02:37:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:19,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-26 02:37:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:19,586 INFO L225 Difference]: With dead ends: 648 [2019-11-26 02:37:19,586 INFO L226 Difference]: Without dead ends: 410 [2019-11-26 02:37:19,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-26 02:37:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 397. [2019-11-26 02:37:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-26 02:37:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 609 transitions. [2019-11-26 02:37:19,598 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 609 transitions. Word has length 21 [2019-11-26 02:37:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:19,599 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 609 transitions. [2019-11-26 02:37:19,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 609 transitions. [2019-11-26 02:37:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 02:37:19,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:19,600 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:19,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash 200187473, now seen corresponding path program 1 times [2019-11-26 02:37:19,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:19,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858574480] [2019-11-26 02:37:19,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:37:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858574480] [2019-11-26 02:37:19,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:19,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:19,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163395931] [2019-11-26 02:37:19,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:19,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,634 INFO L87 Difference]: Start difference. First operand 397 states and 609 transitions. Second operand 3 states. [2019-11-26 02:37:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:19,680 INFO L93 Difference]: Finished difference Result 728 states and 1124 transitions. [2019-11-26 02:37:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:19,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-26 02:37:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:19,683 INFO L225 Difference]: With dead ends: 728 [2019-11-26 02:37:19,683 INFO L226 Difference]: Without dead ends: 338 [2019-11-26 02:37:19,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-26 02:37:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-11-26 02:37:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-26 02:37:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 521 transitions. [2019-11-26 02:37:19,692 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 521 transitions. Word has length 31 [2019-11-26 02:37:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:19,693 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 521 transitions. [2019-11-26 02:37:19,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 521 transitions. [2019-11-26 02:37:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:37:19,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:19,694 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-26 02:37:19,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 216610019, now seen corresponding path program 1 times [2019-11-26 02:37:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:19,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725153408] [2019-11-26 02:37:19,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:37:19,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725153408] [2019-11-26 02:37:19,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:19,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:19,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361463530] [2019-11-26 02:37:19,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:19,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:19,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:19,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,723 INFO L87 Difference]: Start difference. First operand 338 states and 521 transitions. Second operand 3 states. [2019-11-26 02:37:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:19,776 INFO L93 Difference]: Finished difference Result 663 states and 1028 transitions. [2019-11-26 02:37:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:19,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-26 02:37:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:19,779 INFO L225 Difference]: With dead ends: 663 [2019-11-26 02:37:19,779 INFO L226 Difference]: Without dead ends: 332 [2019-11-26 02:37:19,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-26 02:37:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-11-26 02:37:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 02:37:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 501 transitions. [2019-11-26 02:37:19,785 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 501 transitions. Word has length 32 [2019-11-26 02:37:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:19,785 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 501 transitions. [2019-11-26 02:37:19,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 501 transitions. [2019-11-26 02:37:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 02:37:19,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:19,787 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-26 02:37:19,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 355500931, now seen corresponding path program 1 times [2019-11-26 02:37:19,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267505879] [2019-11-26 02:37:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:37:19,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267505879] [2019-11-26 02:37:19,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:19,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:19,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095190510] [2019-11-26 02:37:19,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:19,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:19,839 INFO L87 Difference]: Start difference. First operand 332 states and 501 transitions. Second operand 4 states. [2019-11-26 02:37:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:20,231 INFO L93 Difference]: Finished difference Result 375 states and 542 transitions. [2019-11-26 02:37:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:20,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-26 02:37:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:20,234 INFO L225 Difference]: With dead ends: 375 [2019-11-26 02:37:20,234 INFO L226 Difference]: Without dead ends: 338 [2019-11-26 02:37:20,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-26 02:37:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 332. [2019-11-26 02:37:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-26 02:37:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 465 transitions. [2019-11-26 02:37:20,242 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 465 transitions. Word has length 36 [2019-11-26 02:37:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:20,243 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 465 transitions. [2019-11-26 02:37:20,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 465 transitions. [2019-11-26 02:37:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:37:20,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:20,244 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-26 02:37:20,244 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash 609617484, now seen corresponding path program 1 times [2019-11-26 02:37:20,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:20,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085342948] [2019-11-26 02:37:20,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:37:20,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085342948] [2019-11-26 02:37:20,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:20,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:20,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884818735] [2019-11-26 02:37:20,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:20,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:20,271 INFO L87 Difference]: Start difference. First operand 332 states and 465 transitions. Second operand 3 states. [2019-11-26 02:37:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:20,308 INFO L93 Difference]: Finished difference Result 634 states and 887 transitions. [2019-11-26 02:37:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:20,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-26 02:37:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:20,311 INFO L225 Difference]: With dead ends: 634 [2019-11-26 02:37:20,311 INFO L226 Difference]: Without dead ends: 309 [2019-11-26 02:37:20,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-26 02:37:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-11-26 02:37:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-26 02:37:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2019-11-26 02:37:20,319 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 37 [2019-11-26 02:37:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:20,319 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2019-11-26 02:37:20,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2019-11-26 02:37:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:37:20,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:20,320 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-26 02:37:20,320 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash 348944307, now seen corresponding path program 1 times [2019-11-26 02:37:20,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:20,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004612639] [2019-11-26 02:37:20,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:37:20,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004612639] [2019-11-26 02:37:20,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:20,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:20,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706163751] [2019-11-26 02:37:20,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:20,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:20,350 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand 3 states. [2019-11-26 02:37:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:20,390 INFO L93 Difference]: Finished difference Result 473 states and 664 transitions. [2019-11-26 02:37:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:20,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-26 02:37:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:20,391 INFO L225 Difference]: With dead ends: 473 [2019-11-26 02:37:20,391 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:37:20,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:37:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:37:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:37:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:37:20,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2019-11-26 02:37:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:20,393 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:37:20,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:37:20,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:37:20,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:37:20,550 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-11-26 02:37:20,550 INFO L444 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-11-26 02:37:20,550 INFO L444 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-11-26 02:37:20,551 INFO L444 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-11-26 02:37:20,552 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L440 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-11-26 02:37:20,553 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-11-26 02:37:20,554 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-11-26 02:37:20,555 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L440 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~this_m_conn~0)) (.cse1 (<= 1 ULTIMATE.start_main_~this_m_delta~0)) (.cse2 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0)) (.cse3 (= 0 ULTIMATE.start_main_~this_m_conn~0))) (or (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~this_m_conn_data_listener~0)) (and (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~q~0 2)) (and .cse1 (= ULTIMATE.start_main_~q~0 0) .cse2 .cse3))) [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-11-26 02:37:20,556 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-11-26 02:37:20,557 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-11-26 02:37:20,558 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-11-26 02:37:20,559 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-11-26 02:37:20,560 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-11-26 02:37:20,561 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-11-26 02:37:20,562 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-11-26 02:37:20,563 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L444 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-11-26 02:37:20,564 INFO L447 ceAbstractionStarter]: At program point L16(lines 16 1255) the Hoare annotation is: true [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-11-26 02:37:20,565 INFO L444 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-11-26 02:37:20,566 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-11-26 02:37:20,567 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-11-26 02:37:20,568 INFO L444 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-11-26 02:37:20,569 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L440 ceAbstractionStarter]: At program point L32-2(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~this_m_delta~0)) (.cse1 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0))) (or (and (<= 4 ULTIMATE.start_main_~q~0) (<= 1 ULTIMATE.start_main_~this_m_conn~0) .cse0 .cse1) (and .cse0 (= ULTIMATE.start_main_~q~0 0) .cse1 (= 0 ULTIMATE.start_main_~this_m_conn~0)))) [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-11-26 02:37:20,570 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-11-26 02:37:20,571 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-26 02:37:20,572 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-11-26 02:37:20,572 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-11-26 02:37:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:37:20 BoogieIcfgContainer [2019-11-26 02:37:20,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:37:20,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:37:20,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:37:20,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:37:20,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:17" (3/4) ... [2019-11-26 02:37:20,592 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:37:20,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-26 02:37:20,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:37:20,657 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_597a2c29-e9b1-40fc-9ee8-bb9dd4a9f133/bin/utaipan/witness.graphml [2019-11-26 02:37:20,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:37:20,659 INFO L168 Benchmark]: Toolchain (without parser) took 6946.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 939.4 MB in the beginning and 916.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,659 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:20,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1236.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -99.2 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,666 INFO L168 Benchmark]: Boogie Preprocessor took 107.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,667 INFO L168 Benchmark]: RCFGBuilder took 1897.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.5 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,667 INFO L168 Benchmark]: TraceAbstraction took 3462.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.0 GB in the beginning and 918.8 MB in the end (delta: 99.6 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,668 INFO L168 Benchmark]: Witness Printer took 68.89 ms. Allocated memory is still 1.3 GB. Free memory was 918.8 MB in the beginning and 916.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:20,670 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1236.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -99.2 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1897.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.5 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3462.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.0 GB in the beginning and 918.8 MB in the end (delta: 99.6 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.89 ms. Allocated memory is still 1.3 GB. Free memory was 918.8 MB in the beginning and 916.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: 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: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((q == 3 && 1 <= this_m_conn) && 1 <= this_m_delta) && 1 <= this_m_conn_data_listener) || (((4 <= q && 1 <= this_m_conn) && 1 <= this_m_delta) && this_m_conn_data_listener == 0)) || (((1 <= this_m_delta && this_m_conn_data_listener == 0) && 0 == this_m_conn) && q == 2)) || (((1 <= this_m_delta && q == 0) && this_m_conn_data_listener == 0) && 0 == this_m_conn) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((4 <= q && 1 <= this_m_conn) && 1 <= this_m_delta) && this_m_conn_data_listener == 0) || (((1 <= this_m_delta && q == 0) && this_m_conn_data_listener == 0) && 0 == this_m_conn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 235 locations, 1 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 4020 SDtfs, 2122 SDslu, 1749 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 82 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 11282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...