./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:33:48,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:33:48,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:33:49,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:33:49,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:33:49,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:33:49,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:33:49,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:33:49,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:33:49,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:33:49,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:33:49,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:33:49,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:33:49,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:33:49,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:33:49,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:33:49,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:33:49,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:33:49,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:33:49,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:33:49,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:33:49,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:33:49,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:33:49,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:33:49,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:33:49,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:33:49,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:33:49,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:33:49,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:33:49,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:33:49,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:33:49,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:33:49,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:33:49,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:33:49,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:33:49,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:33:49,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:33:49,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:33:49,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:33:49,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:33:49,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:33:49,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:33:49,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:33:49,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:33:49,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:33:49,047 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:33:49,047 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:33:49,047 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:33:49,048 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:33:49,048 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:33:49,049 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:33:49,049 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:33:49,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:33:49,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:33:49,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:33:49,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:33:49,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:33:49,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:33:49,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:33:49,052 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_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-12-07 19:33:49,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:33:49,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:33:49,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:33:49,172 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:33:49,173 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:33:49,173 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-12-07 19:33:49,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/data/814d81689/0bd07d1a54074228839ec0f0be2f1aed/FLAGb707bd427 [2019-12-07 19:33:49,644 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:33:49,645 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-12-07 19:33:49,653 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/data/814d81689/0bd07d1a54074228839ec0f0be2f1aed/FLAGb707bd427 [2019-12-07 19:33:49,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/data/814d81689/0bd07d1a54074228839ec0f0be2f1aed [2019-12-07 19:33:49,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:33:49,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:33:49,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:33:49,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:33:49,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:33:49,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:49,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c062e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49, skipping insertion in model container [2019-12-07 19:33:49,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:49,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:33:49,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:33:49,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:33:49,900 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:33:49,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:33:49,950 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:33:49,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49 WrapperNode [2019-12-07 19:33:49,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:33:49,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:33:49,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:33:49,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:33:49,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:49,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:33:50,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:33:50,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:33:50,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:33:50,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... [2019-12-07 19:33:50,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:33:50,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:33:50,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:33:50,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:33:50,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/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-12-07 19:33:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:33:50,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:33:50,581 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:33:50,582 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 19:33:50,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:33:50 BoogieIcfgContainer [2019-12-07 19:33:50,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:33:50,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:33:50,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:33:50,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:33:50,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:33:49" (1/3) ... [2019-12-07 19:33:50,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb17a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:33:50, skipping insertion in model container [2019-12-07 19:33:50,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:33:49" (2/3) ... [2019-12-07 19:33:50,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb17a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:33:50, skipping insertion in model container [2019-12-07 19:33:50,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:33:50" (3/3) ... [2019-12-07 19:33:50,587 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-12-07 19:33:50,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:33:50,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:33:50,605 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:33:50,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:33:50,621 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:33:50,621 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:33:50,621 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:33:50,621 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:33:50,621 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:33:50,621 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:33:50,621 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:33:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-12-07 19:33:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:33:50,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:50,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:50,637 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1235094703, now seen corresponding path program 1 times [2019-12-07 19:33:50,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:50,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30220508] [2019-12-07 19:33:50,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:50,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30220508] [2019-12-07 19:33:50,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:50,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:33:50,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828578803] [2019-12-07 19:33:50,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:33:50,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:33:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:33:50,747 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-12-07 19:33:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:50,766 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2019-12-07 19:33:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:33:50,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 19:33:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:50,775 INFO L225 Difference]: With dead ends: 213 [2019-12-07 19:33:50,775 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 19:33:50,777 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-12-07 19:33:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 19:33:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 19:33:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 19:33:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 164 transitions. [2019-12-07 19:33:50,805 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 164 transitions. Word has length 8 [2019-12-07 19:33:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:50,805 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 164 transitions. [2019-12-07 19:33:50,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:33:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 164 transitions. [2019-12-07 19:33:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:33:50,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:50,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:50,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 899257357, now seen corresponding path program 1 times [2019-12-07 19:33:50,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:50,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105072169] [2019-12-07 19:33:50,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:50,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105072169] [2019-12-07 19:33:50,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:50,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:33:50,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877223567] [2019-12-07 19:33:50,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:50,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:50,836 INFO L87 Difference]: Start difference. First operand 99 states and 164 transitions. Second operand 3 states. [2019-12-07 19:33:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:50,868 INFO L93 Difference]: Finished difference Result 200 states and 331 transitions. [2019-12-07 19:33:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:50,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:33:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:50,870 INFO L225 Difference]: With dead ends: 200 [2019-12-07 19:33:50,870 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 19:33:50,871 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-12-07 19:33:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 19:33:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 19:33:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 19:33:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2019-12-07 19:33:50,878 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 9 [2019-12-07 19:33:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:50,878 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2019-12-07 19:33:50,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2019-12-07 19:33:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:33:50,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:50,879 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:50,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1778638772, now seen corresponding path program 1 times [2019-12-07 19:33:50,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:50,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143925974] [2019-12-07 19:33:50,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:51,188 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-12-07 19:33:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:51,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143925974] [2019-12-07 19:33:51,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:51,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:33:51,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146470033] [2019-12-07 19:33:51,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:33:51,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:33:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:33:51,192 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand 4 states. [2019-12-07 19:33:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:51,458 INFO L93 Difference]: Finished difference Result 204 states and 333 transitions. [2019-12-07 19:33:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:51,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:33:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:51,461 INFO L225 Difference]: With dead ends: 204 [2019-12-07 19:33:51,461 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 19:33:51,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:33:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 19:33:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2019-12-07 19:33:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 19:33:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 280 transitions. [2019-12-07 19:33:51,477 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 280 transitions. Word has length 14 [2019-12-07 19:33:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:51,477 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 280 transitions. [2019-12-07 19:33:51,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:33:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 280 transitions. [2019-12-07 19:33:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:33:51,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:51,478 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:51,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2054474346, now seen corresponding path program 1 times [2019-12-07 19:33:51,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:51,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98761657] [2019-12-07 19:33:51,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:51,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98761657] [2019-12-07 19:33:51,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:51,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:51,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703473880] [2019-12-07 19:33:51,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:51,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:51,513 INFO L87 Difference]: Start difference. First operand 171 states and 280 transitions. Second operand 3 states. [2019-12-07 19:33:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:51,543 INFO L93 Difference]: Finished difference Result 292 states and 476 transitions. [2019-12-07 19:33:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:51,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 19:33:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:51,545 INFO L225 Difference]: With dead ends: 292 [2019-12-07 19:33:51,545 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 19:33:51,547 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-12-07 19:33:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 19:33:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-12-07 19:33:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 19:33:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2019-12-07 19:33:51,556 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 15 [2019-12-07 19:33:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:51,556 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2019-12-07 19:33:51,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2019-12-07 19:33:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:33:51,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:51,557 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:51,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -728910377, now seen corresponding path program 1 times [2019-12-07 19:33:51,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:51,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713604225] [2019-12-07 19:33:51,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:33:51,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713604225] [2019-12-07 19:33:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:51,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:51,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691426975] [2019-12-07 19:33:51,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:51,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:51,598 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 3 states. [2019-12-07 19:33:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:51,622 INFO L93 Difference]: Finished difference Result 225 states and 357 transitions. [2019-12-07 19:33:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:51,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:33:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:51,624 INFO L225 Difference]: With dead ends: 225 [2019-12-07 19:33:51,624 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 19:33:51,625 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-12-07 19:33:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 19:33:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-12-07 19:33:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 19:33:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 162 transitions. [2019-12-07 19:33:51,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 162 transitions. Word has length 20 [2019-12-07 19:33:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:51,632 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 162 transitions. [2019-12-07 19:33:51,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 162 transitions. [2019-12-07 19:33:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:33:51,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:51,634 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:51,634 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:51,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1707782936, now seen corresponding path program 1 times [2019-12-07 19:33:51,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:51,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123222181] [2019-12-07 19:33:51,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:55,837 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-12-07 19:33:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123222181] [2019-12-07 19:33:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88262416] [2019-12-07 19:33:55,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:33:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:55,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:33:55,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:33:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:55,923 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:33:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:55,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1027388484] [2019-12-07 19:33:55,963 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 19:33:55,964 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:33:55,967 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:33:55,972 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:33:55,972 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:33:56,563 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:33:56,767 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-12-07 19:33:57,837 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-12-07 19:33:57,839 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:33:57,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:33:57,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-12-07 19:33:57,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322047833] [2019-12-07 19:33:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:33:57,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:33:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-07 19:33:57,840 INFO L87 Difference]: Start difference. First operand 104 states and 162 transitions. Second operand 9 states. [2019-12-07 19:33:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:58,307 INFO L93 Difference]: Finished difference Result 358 states and 563 transitions. [2019-12-07 19:33:58,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:33:58,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 19:33:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:58,310 INFO L225 Difference]: With dead ends: 358 [2019-12-07 19:33:58,310 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 19:33:58,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:33:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 19:33:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 274. [2019-12-07 19:33:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-07 19:33:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 433 transitions. [2019-12-07 19:33:58,325 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 433 transitions. Word has length 22 [2019-12-07 19:33:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:58,325 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 433 transitions. [2019-12-07 19:33:58,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:33:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 433 transitions. [2019-12-07 19:33:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:33:58,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:58,326 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:58,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:33:58,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash -97156331, now seen corresponding path program 1 times [2019-12-07 19:33:58,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:58,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512010290] [2019-12-07 19:33:58,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:33:58,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512010290] [2019-12-07 19:33:58,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:58,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:58,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667538210] [2019-12-07 19:33:58,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:58,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:58,555 INFO L87 Difference]: Start difference. First operand 274 states and 433 transitions. Second operand 3 states. [2019-12-07 19:33:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:58,580 INFO L93 Difference]: Finished difference Result 547 states and 860 transitions. [2019-12-07 19:33:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:58,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 19:33:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:58,581 INFO L225 Difference]: With dead ends: 547 [2019-12-07 19:33:58,582 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 19:33:58,582 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-12-07 19:33:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 19:33:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-12-07 19:33:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 19:33:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 453 transitions. [2019-12-07 19:33:58,590 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 453 transitions. Word has length 24 [2019-12-07 19:33:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:58,590 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 453 transitions. [2019-12-07 19:33:58,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 453 transitions. [2019-12-07 19:33:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:33:58,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:58,591 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:58,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2003320486, now seen corresponding path program 1 times [2019-12-07 19:33:58,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:58,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16744389] [2019-12-07 19:33:58,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:58,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16744389] [2019-12-07 19:33:58,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74724288] [2019-12-07 19:33:58,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:33:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:58,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:33:58,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:33:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:33:58,768 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:33:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:33:58,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:33:58,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 19:33:58,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833657178] [2019-12-07 19:33:58,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:33:58,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:33:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:33:58,814 INFO L87 Difference]: Start difference. First operand 294 states and 453 transitions. Second operand 4 states. [2019-12-07 19:33:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:58,830 INFO L93 Difference]: Finished difference Result 297 states and 455 transitions. [2019-12-07 19:33:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:58,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 19:33:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:58,833 INFO L225 Difference]: With dead ends: 297 [2019-12-07 19:33:58,833 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 19:33:58,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:33:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 19:33:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-12-07 19:33:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-07 19:33:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 441 transitions. [2019-12-07 19:33:58,843 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 441 transitions. Word has length 26 [2019-12-07 19:33:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:58,843 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 441 transitions. [2019-12-07 19:33:58,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:33:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 441 transitions. [2019-12-07 19:33:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:33:58,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:58,845 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:59,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:33:59,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1408238156, now seen corresponding path program 1 times [2019-12-07 19:33:59,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:59,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354456828] [2019-12-07 19:33:59,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:33:59,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354456828] [2019-12-07 19:33:59,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:59,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:59,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432880300] [2019-12-07 19:33:59,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:59,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:59,072 INFO L87 Difference]: Start difference. First operand 290 states and 441 transitions. Second operand 3 states. [2019-12-07 19:33:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:59,095 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2019-12-07 19:33:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:59,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 19:33:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:59,097 INFO L225 Difference]: With dead ends: 509 [2019-12-07 19:33:59,098 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 19:33:59,098 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-12-07 19:33:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 19:33:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-12-07 19:33:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 19:33:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2019-12-07 19:33:59,106 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 32 [2019-12-07 19:33:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:59,106 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2019-12-07 19:33:59,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2019-12-07 19:33:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:33:59,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:59,108 INFO L410 BasicCegarLoop]: trace histogram [4, 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-12-07 19:33:59,108 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:59,108 INFO L82 PathProgramCache]: Analyzing trace with hash -487022107, now seen corresponding path program 1 times [2019-12-07 19:33:59,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:59,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845724163] [2019-12-07 19:33:59,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 19:33:59,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845724163] [2019-12-07 19:33:59,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:59,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:59,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461619272] [2019-12-07 19:33:59,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:59,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:59,134 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand 3 states. [2019-12-07 19:33:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:59,158 INFO L93 Difference]: Finished difference Result 423 states and 631 transitions. [2019-12-07 19:33:59,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:59,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 19:33:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:59,160 INFO L225 Difference]: With dead ends: 423 [2019-12-07 19:33:59,160 INFO L226 Difference]: Without dead ends: 224 [2019-12-07 19:33:59,161 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-12-07 19:33:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-12-07 19:33:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-12-07 19:33:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 19:33:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2019-12-07 19:33:59,167 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 36 [2019-12-07 19:33:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:59,167 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2019-12-07 19:33:59,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2019-12-07 19:33:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:33:59,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:59,169 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:33:59,169 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1378383767, now seen corresponding path program 1 times [2019-12-07 19:33:59,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:59,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408680938] [2019-12-07 19:33:59,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 19:33:59,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408680938] [2019-12-07 19:33:59,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:33:59,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:33:59,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063701827] [2019-12-07 19:33:59,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:33:59,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:33:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:33:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:33:59,203 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand 3 states. [2019-12-07 19:33:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:33:59,223 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-12-07 19:33:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:33:59,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 19:33:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:33:59,224 INFO L225 Difference]: With dead ends: 304 [2019-12-07 19:33:59,224 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 19:33:59,225 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-12-07 19:33:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 19:33:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-12-07 19:33:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 19:33:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2019-12-07 19:33:59,228 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 45 [2019-12-07 19:33:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:33:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2019-12-07 19:33:59,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:33:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2019-12-07 19:33:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 19:33:59,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:33:59,229 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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-12-07 19:33:59,229 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:33:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:33:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1173572958, now seen corresponding path program 1 times [2019-12-07 19:33:59,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:33:59,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262776910] [2019-12-07 19:33:59,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:33:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:33:59,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262776910] [2019-12-07 19:33:59,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129984800] [2019-12-07 19:33:59,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:33:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:33:59,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 19:33:59,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:33:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:59,470 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:33:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:33:59,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1299567907] [2019-12-07 19:33:59,547 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-12-07 19:33:59,547 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:33:59,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:33:59,548 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:33:59,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:34:01,552 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:34:03,250 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:34:03,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:03,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-12-07 19:34:03,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652235710] [2019-12-07 19:34:03,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:34:03,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:34:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:34:03,252 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand 14 states. [2019-12-07 19:34:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:03,440 INFO L93 Difference]: Finished difference Result 162 states and 230 transitions. [2019-12-07 19:34:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:34:03,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-12-07 19:34:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:03,441 INFO L225 Difference]: With dead ends: 162 [2019-12-07 19:34:03,441 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:34:03,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=1979, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 19:34:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:34:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:34:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:34:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:34:03,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-12-07 19:34:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:03,443 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:34:03,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:34:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:34:03,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:34:03,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:03,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:34:03,977 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-12-07 19:34:04,064 INFO L246 CegarLoopResult]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-12-07 19:34:04,065 INFO L246 CegarLoopResult]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-12-07 19:34:04,066 INFO L246 CegarLoopResult]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-12-07 19:34:04,067 INFO L246 CegarLoopResult]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L249 CegarLoopResult]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-12-07 19:34:04,068 INFO L246 CegarLoopResult]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-12-07 19:34:04,069 INFO L246 CegarLoopResult]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L242 CegarLoopResult]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L242 CegarLoopResult]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)))) [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-12-07 19:34:04,070 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-12-07 19:34:04,071 INFO L246 CegarLoopResult]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L242 CegarLoopResult]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse5 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse4 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 1) .cse1 .cse4 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 3) .cse5 .cse0 .cse2 .cse3) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse4 .cse2 .cse3))) [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-12-07 19:34:04,072 INFO L246 CegarLoopResult]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-12-07 19:34:04,073 INFO L246 CegarLoopResult]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-12-07 19:34:04,074 INFO L246 CegarLoopResult]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-12-07 19:34:04,075 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-12-07 19:34:04,076 INFO L246 CegarLoopResult]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-12-07 19:34:04,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:34:04 BoogieIcfgContainer [2019-12-07 19:34:04,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:34:04,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:34:04,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:34:04,098 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:34:04,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:33:50" (3/4) ... [2019-12-07 19:34:04,100 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:34:04,110 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 19:34:04,110 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:34:04,135 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c34802d7-a834-4a80-8c5f-cca2c2b0cb1a/bin/utaipan/witness.graphml [2019-12-07 19:34:04,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:34:04,136 INFO L168 Benchmark]: Toolchain (without parser) took 14472.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 943.5 MB in the beginning and 1.2 GB in the end (delta: -299.6 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,137 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:34:04,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,138 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:34:04,138 INFO L168 Benchmark]: RCFGBuilder took 537.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,138 INFO L168 Benchmark]: TraceAbstraction took 13514.05 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -219.1 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,139 INFO L168 Benchmark]: Witness Printer took 38.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:34:04,140 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 537.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13514.05 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -219.1 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * Witness Printer took 38.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((q == 1 && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((q == 3 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((0 <= this_expect && this_buffer_empty == 0) && this_expect <= 0) && q == 0)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((0 <= this_expect && this_buffer_empty == 0) && this_expect <= 0) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: SAFE, OverallTime: 13.0s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 1790 SDtfs, 2028 SDslu, 2271 SDs, 0 SdLazy, 513 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=7, 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, 71 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 484 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 250 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 467 ConstructedInterpolants, 11 QuantifiedInterpolants, 127966 SizeOfPredicates, 11 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 153/235 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...