./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325feb12f40756470caf3b12878fd0ec9ad6f61 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:58:21,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:58:21,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:58:21,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:58:21,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:58:21,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:58:21,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:58:21,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:58:21,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:58:21,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:58:22,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:58:22,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:58:22,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:58:22,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:58:22,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:58:22,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:58:22,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:58:22,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:58:22,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:58:22,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:58:22,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:58:22,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:58:22,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:58:22,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:58:22,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:58:22,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:58:22,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:58:22,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:58:22,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:58:22,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:58:22,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:58:22,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:58:22,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:58:22,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:58:22,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:58:22,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:58:22,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:58:22,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:58:22,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:58:22,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:58:22,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:58:22,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 12:58:22,061 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:58:22,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:58:22,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:58:22,068 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:58:22,069 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 12:58:22,069 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 12:58:22,070 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:58:22,070 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 12:58:22,070 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 12:58:22,070 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 12:58:22,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 12:58:22,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 12:58:22,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:58:22,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:58:22,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:58:22,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:58:22,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 12:58:22,073 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 12:58:22,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 12:58:22,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 12:58:22,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:58:22,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:58:22,074 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/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(reach_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 -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2020-12-09 12:58:22,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:58:22,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:58:22,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:58:22,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:58:22,282 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:58:22,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-12-09 12:58:22,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/data/05e2310c9/abe0ce73050243c3a34806da9525622e/FLAGef04b3e0a [2020-12-09 12:58:22,693 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:58:22,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-12-09 12:58:22,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/data/05e2310c9/abe0ce73050243c3a34806da9525622e/FLAGef04b3e0a [2020-12-09 12:58:22,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/data/05e2310c9/abe0ce73050243c3a34806da9525622e [2020-12-09 12:58:22,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:58:22,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:58:22,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:58:22,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:58:22,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:58:22,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b49dd79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22, skipping insertion in model container [2020-12-09 12:58:22,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:58:22,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:58:22,832 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2020-12-09 12:58:22,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:58:22,870 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:58:22,878 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2020-12-09 12:58:22,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:58:22,908 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:58:22,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22 WrapperNode [2020-12-09 12:58:22,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:58:22,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:58:22,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:58:22,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:58:22,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:58:22,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:58:22,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:58:22,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:58:22,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... [2020-12-09 12:58:22,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:58:22,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:58:22,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:58:22,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:58:22,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/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 [2020-12-09 12:58:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:58:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 12:58:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:58:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:58:23,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:58:23,719 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2020-12-09 12:58:23,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:58:23 BoogieIcfgContainer [2020-12-09 12:58:23,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:58:23,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:58:23,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:58:23,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:58:23,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:58:22" (1/3) ... [2020-12-09 12:58:23,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bab9665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:58:23, skipping insertion in model container [2020-12-09 12:58:23,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:58:22" (2/3) ... [2020-12-09 12:58:23,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bab9665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:58:23, skipping insertion in model container [2020-12-09 12:58:23,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:58:23" (3/3) ... [2020-12-09 12:58:23,727 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-12-09 12:58:23,736 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:58:23,739 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 12:58:23,746 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 12:58:23,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:58:23,763 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 12:58:23,763 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:58:23,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:58:23,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:58:23,763 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:58:23,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:58:23,763 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:58:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-12-09 12:58:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 12:58:23,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:23,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:23,778 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash 737731866, now seen corresponding path program 1 times [2020-12-09 12:58:23,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:23,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926572829] [2020-12-09 12:58:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:23,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926572829] [2020-12-09 12:58:23,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:23,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:23,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752266946] [2020-12-09 12:58:23,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:58:23,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:58:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:58:23,918 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 4 states. [2020-12-09 12:58:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,019 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2020-12-09 12:58:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:58:24,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 12:58:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,028 INFO L225 Difference]: With dead ends: 204 [2020-12-09 12:58:24,028 INFO L226 Difference]: Without dead ends: 137 [2020-12-09 12:58:24,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:58:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-09 12:58:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2020-12-09 12:58:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-09 12:58:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2020-12-09 12:58:24,062 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 16 [2020-12-09 12:58:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,062 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2020-12-09 12:58:24,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:58:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2020-12-09 12:58:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 12:58:24,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,064 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 12:58:24,064 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,065 INFO L82 PathProgramCache]: Analyzing trace with hash 233244576, now seen corresponding path program 1 times [2020-12-09 12:58:24,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267120358] [2020-12-09 12:58:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:24,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267120358] [2020-12-09 12:58:24,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:24,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664596729] [2020-12-09 12:58:24,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:24,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,113 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand 3 states. [2020-12-09 12:58:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,152 INFO L93 Difference]: Finished difference Result 279 states and 398 transitions. [2020-12-09 12:58:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:24,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 12:58:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,155 INFO L225 Difference]: With dead ends: 279 [2020-12-09 12:58:24,155 INFO L226 Difference]: Without dead ends: 162 [2020-12-09 12:58:24,157 INFO L677 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 [2020-12-09 12:58:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-09 12:58:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2020-12-09 12:58:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-09 12:58:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2020-12-09 12:58:24,174 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 23 [2020-12-09 12:58:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,174 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2020-12-09 12:58:24,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2020-12-09 12:58:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 12:58:24,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,176 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 12:58:24,177 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -178520705, now seen corresponding path program 1 times [2020-12-09 12:58:24,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555935682] [2020-12-09 12:58:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:58:24,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555935682] [2020-12-09 12:58:24,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:58:24,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492988304] [2020-12-09 12:58:24,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:24,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:24,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,249 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand 3 states. [2020-12-09 12:58:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,285 INFO L93 Difference]: Finished difference Result 343 states and 496 transitions. [2020-12-09 12:58:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:24,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-09 12:58:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,288 INFO L225 Difference]: With dead ends: 343 [2020-12-09 12:58:24,288 INFO L226 Difference]: Without dead ends: 235 [2020-12-09 12:58:24,289 INFO L677 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 [2020-12-09 12:58:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-09 12:58:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 193. [2020-12-09 12:58:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-09 12:58:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2020-12-09 12:58:24,303 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 24 [2020-12-09 12:58:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,303 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2020-12-09 12:58:24,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2020-12-09 12:58:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 12:58:24,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,305 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 12:58:24,305 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash -492670809, now seen corresponding path program 1 times [2020-12-09 12:58:24,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087896444] [2020-12-09 12:58:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:58:24,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087896444] [2020-12-09 12:58:24,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:24,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294660441] [2020-12-09 12:58:24,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:58:24,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:58:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:58:24,373 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 4 states. [2020-12-09 12:58:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,455 INFO L93 Difference]: Finished difference Result 628 states and 894 transitions. [2020-12-09 12:58:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:58:24,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-12-09 12:58:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,457 INFO L225 Difference]: With dead ends: 628 [2020-12-09 12:58:24,458 INFO L226 Difference]: Without dead ends: 442 [2020-12-09 12:58:24,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:58:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-12-09 12:58:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 334. [2020-12-09 12:58:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-12-09 12:58:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 463 transitions. [2020-12-09 12:58:24,484 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 463 transitions. Word has length 42 [2020-12-09 12:58:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,485 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 463 transitions. [2020-12-09 12:58:24,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:58:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 463 transitions. [2020-12-09 12:58:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 12:58:24,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,489 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 12:58:24,489 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1916836504, now seen corresponding path program 1 times [2020-12-09 12:58:24,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536498321] [2020-12-09 12:58:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:24,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536498321] [2020-12-09 12:58:24,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:58:24,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702904279] [2020-12-09 12:58:24,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:58:24,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:58:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:58:24,543 INFO L87 Difference]: Start difference. First operand 334 states and 463 transitions. Second operand 5 states. [2020-12-09 12:58:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,619 INFO L93 Difference]: Finished difference Result 615 states and 856 transitions. [2020-12-09 12:58:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:58:24,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-12-09 12:58:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,620 INFO L225 Difference]: With dead ends: 615 [2020-12-09 12:58:24,621 INFO L226 Difference]: Without dead ends: 288 [2020-12-09 12:58:24,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:58:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-09 12:58:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 259. [2020-12-09 12:58:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-12-09 12:58:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 360 transitions. [2020-12-09 12:58:24,631 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 360 transitions. Word has length 43 [2020-12-09 12:58:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,632 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 360 transitions. [2020-12-09 12:58:24,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:58:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 360 transitions. [2020-12-09 12:58:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 12:58:24,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,633 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 12:58:24,633 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1646902370, now seen corresponding path program 1 times [2020-12-09 12:58:24,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926041097] [2020-12-09 12:58:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:24,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926041097] [2020-12-09 12:58:24,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:24,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827600988] [2020-12-09 12:58:24,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:24,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,671 INFO L87 Difference]: Start difference. First operand 259 states and 360 transitions. Second operand 3 states. [2020-12-09 12:58:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,709 INFO L93 Difference]: Finished difference Result 429 states and 599 transitions. [2020-12-09 12:58:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:24,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-09 12:58:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,711 INFO L225 Difference]: With dead ends: 429 [2020-12-09 12:58:24,711 INFO L226 Difference]: Without dead ends: 178 [2020-12-09 12:58:24,712 INFO L677 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 [2020-12-09 12:58:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-12-09 12:58:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2020-12-09 12:58:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 12:58:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 226 transitions. [2020-12-09 12:58:24,722 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 226 transitions. Word has length 45 [2020-12-09 12:58:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,722 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 226 transitions. [2020-12-09 12:58:24,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2020-12-09 12:58:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 12:58:24,723 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,723 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 12:58:24,723 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1577641247, now seen corresponding path program 1 times [2020-12-09 12:58:24,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821442023] [2020-12-09 12:58:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:24,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821442023] [2020-12-09 12:58:24,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:58:24,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077882778] [2020-12-09 12:58:24,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:58:24,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:58:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:58:24,778 INFO L87 Difference]: Start difference. First operand 173 states and 226 transitions. Second operand 5 states. [2020-12-09 12:58:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,863 INFO L93 Difference]: Finished difference Result 338 states and 445 transitions. [2020-12-09 12:58:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 12:58:24,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-09 12:58:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,864 INFO L225 Difference]: With dead ends: 338 [2020-12-09 12:58:24,864 INFO L226 Difference]: Without dead ends: 205 [2020-12-09 12:58:24,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:58:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-12-09 12:58:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2020-12-09 12:58:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 12:58:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2020-12-09 12:58:24,872 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 45 [2020-12-09 12:58:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,872 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2020-12-09 12:58:24,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:58:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2020-12-09 12:58:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 12:58:24,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,873 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 12:58:24,873 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1171353703, now seen corresponding path program 1 times [2020-12-09 12:58:24,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324443955] [2020-12-09 12:58:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 12:58:24,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324443955] [2020-12-09 12:58:24,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 12:58:24,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914465777] [2020-12-09 12:58:24,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:24,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,911 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand 3 states. [2020-12-09 12:58:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,933 INFO L93 Difference]: Finished difference Result 255 states and 330 transitions. [2020-12-09 12:58:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:24,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-09 12:58:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,934 INFO L225 Difference]: With dead ends: 255 [2020-12-09 12:58:24,934 INFO L226 Difference]: Without dead ends: 173 [2020-12-09 12:58:24,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-09 12:58:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-12-09 12:58:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 12:58:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 216 transitions. [2020-12-09 12:58:24,942 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 216 transitions. Word has length 46 [2020-12-09 12:58:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,942 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 216 transitions. [2020-12-09 12:58:24,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 216 transitions. [2020-12-09 12:58:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 12:58:24,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:24,942 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:24,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 12:58:24,943 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -180189030, now seen corresponding path program 1 times [2020-12-09 12:58:24,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:24,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204711544] [2020-12-09 12:58:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:24,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204711544] [2020-12-09 12:58:24,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:24,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:24,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809938492] [2020-12-09 12:58:24,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:24,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:24,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:24,968 INFO L87 Difference]: Start difference. First operand 173 states and 216 transitions. Second operand 3 states. [2020-12-09 12:58:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:24,990 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2020-12-09 12:58:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:24,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-09 12:58:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:24,991 INFO L225 Difference]: With dead ends: 267 [2020-12-09 12:58:24,991 INFO L226 Difference]: Without dead ends: 185 [2020-12-09 12:58:24,992 INFO L677 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 [2020-12-09 12:58:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-09 12:58:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2020-12-09 12:58:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-09 12:58:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 207 transitions. [2020-12-09 12:58:24,999 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 207 transitions. Word has length 46 [2020-12-09 12:58:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:24,999 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 207 transitions. [2020-12-09 12:58:24,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 207 transitions. [2020-12-09 12:58:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 12:58:25,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:25,000 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:25,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 12:58:25,000 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -121142408, now seen corresponding path program 1 times [2020-12-09 12:58:25,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:25,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143748952] [2020-12-09 12:58:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:25,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143748952] [2020-12-09 12:58:25,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230068368] [2020-12-09 12:58:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/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 [2020-12-09 12:58:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:25,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 12:58:25,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:58:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:25,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:58:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:58:25,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 12:58:25,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 12:58:25,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504441182] [2020-12-09 12:58:25,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:58:25,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:25,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:58:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:58:25,171 INFO L87 Difference]: Start difference. First operand 173 states and 207 transitions. Second operand 4 states. [2020-12-09 12:58:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:25,214 INFO L93 Difference]: Finished difference Result 359 states and 432 transitions. [2020-12-09 12:58:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:58:25,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-12-09 12:58:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:25,216 INFO L225 Difference]: With dead ends: 359 [2020-12-09 12:58:25,216 INFO L226 Difference]: Without dead ends: 226 [2020-12-09 12:58:25,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 12:58:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-12-09 12:58:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2020-12-09 12:58:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-09 12:58:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2020-12-09 12:58:25,229 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 47 [2020-12-09 12:58:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:25,229 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2020-12-09 12:58:25,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:58:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2020-12-09 12:58:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 12:58:25,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:25,230 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:25,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 12:58:25,432 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash 813103306, now seen corresponding path program 1 times [2020-12-09 12:58:25,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:25,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906302852] [2020-12-09 12:58:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:58:25,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906302852] [2020-12-09 12:58:25,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:25,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:58:25,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909786219] [2020-12-09 12:58:25,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:58:25,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:58:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:58:25,590 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand 6 states. [2020-12-09 12:58:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:25,704 INFO L93 Difference]: Finished difference Result 342 states and 413 transitions. [2020-12-09 12:58:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 12:58:25,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-12-09 12:58:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:25,705 INFO L225 Difference]: With dead ends: 342 [2020-12-09 12:58:25,705 INFO L226 Difference]: Without dead ends: 130 [2020-12-09 12:58:25,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 12:58:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-09 12:58:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2020-12-09 12:58:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 12:58:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2020-12-09 12:58:25,714 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 47 [2020-12-09 12:58:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:25,714 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2020-12-09 12:58:25,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:58:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2020-12-09 12:58:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-09 12:58:25,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:25,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:25,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 12:58:25,715 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1205662608, now seen corresponding path program 1 times [2020-12-09 12:58:25,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:25,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439469451] [2020-12-09 12:58:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:58:25,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439469451] [2020-12-09 12:58:25,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:25,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 12:58:25,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170197747] [2020-12-09 12:58:25,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 12:58:25,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:25,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 12:58:25,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:58:25,777 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2020-12-09 12:58:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:25,807 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2020-12-09 12:58:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 12:58:25,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-09 12:58:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:25,809 INFO L225 Difference]: With dead ends: 208 [2020-12-09 12:58:25,809 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 12:58:25,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 12:58:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 12:58:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 163. [2020-12-09 12:58:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 12:58:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2020-12-09 12:58:25,822 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 48 [2020-12-09 12:58:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:25,822 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2020-12-09 12:58:25,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 12:58:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2020-12-09 12:58:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-09 12:58:25,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:25,823 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:25,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 12:58:25,823 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash -906446050, now seen corresponding path program 1 times [2020-12-09 12:58:25,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:25,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084751761] [2020-12-09 12:58:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 12:58:25,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084751761] [2020-12-09 12:58:25,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:25,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 12:58:25,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396876595] [2020-12-09 12:58:25,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 12:58:25,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 12:58:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 12:58:25,886 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2020-12-09 12:58:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:25,984 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2020-12-09 12:58:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 12:58:25,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-12-09 12:58:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:25,985 INFO L225 Difference]: With dead ends: 290 [2020-12-09 12:58:25,985 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 12:58:25,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-09 12:58:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 12:58:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2020-12-09 12:58:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 12:58:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2020-12-09 12:58:25,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 78 [2020-12-09 12:58:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:25,998 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2020-12-09 12:58:25,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 12:58:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2020-12-09 12:58:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 12:58:25,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:58:25,999 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:58:25,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 12:58:26,000 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:58:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:58:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1171754606, now seen corresponding path program 1 times [2020-12-09 12:58:26,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:58:26,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240223987] [2020-12-09 12:58:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:58:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:58:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 12:58:26,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240223987] [2020-12-09 12:58:26,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:58:26,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 12:58:26,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920548109] [2020-12-09 12:58:26,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 12:58:26,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:58:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 12:58:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 12:58:26,034 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 3 states. [2020-12-09 12:58:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:58:26,050 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2020-12-09 12:58:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 12:58:26,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-09 12:58:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:58:26,051 INFO L225 Difference]: With dead ends: 220 [2020-12-09 12:58:26,051 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 12:58:26,051 INFO L677 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 [2020-12-09 12:58:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 12:58:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 12:58:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 12:58:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 12:58:26,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-12-09 12:58:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:58:26,052 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 12:58:26,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 12:58:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 12:58:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 12:58:26,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 12:58:26,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 12:58:26,341 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-12-09 12:58:26,778 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-12-09 12:58:26,967 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-09 12:58:27,151 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2020-12-09 12:58:27,171 INFO L262 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-12-09 12:58:27,172 INFO L258 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (and (<= ~token~0 (+ ~local~0 1)) (= ~t1_pc~0 1) (= ~m_pc~0 1) (= ~E_1~0 2) (<= 2 ~E_M~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (not (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (not (= ~m_st~0 0)) (< ~local~0 ~token~0)) [2020-12-09 12:58:27,172 INFO L262 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-12-09 12:58:27,172 INFO L262 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-12-09 12:58:27,172 INFO L258 CegarLoopResult]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,172 INFO L258 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,172 INFO L258 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~E_1~0 2)) (.cse3 (<= 2 ~E_M~0)) (.cse1 (not (= ~m_st~0 0)))) (or (and .cse0 (= ~m_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse1 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,172 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-09 12:58:27,172 INFO L258 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse6 (= ~m_pc~0 0)) (.cse1 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (not .cse13)) (.cse9 (<= 2 ~t1_st~0)) (.cse12 (= ~m_pc~0 1)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse12 .cse7 .cse8 .cse4 .cse3 .cse5 .cse2) (and .cse11 .cse1 (= ~m_st~0 ~E_1~0) .cse7 .cse12 .cse8 .cse2 .cse4 .cse5) (and .cse10 .cse11 .cse7 .cse12 .cse8 .cse4 .cse2 .cse3 .cse5) (and .cse9 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse12 .cse13 .cse2 (not .cse11) .cse4 (< ~local~0 ~token~0) .cse5)))) [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= 2 ~E_M~0) (= ~m_pc~0 0)) [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0))) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0)) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse5 .cse4 .cse3))) [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L80(lines 80 88) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~m_st~0 0)) (.cse5 (= ~E_1~0 2))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~E_M~0 1) .cse1 (= ~m_pc~0 1) .cse2 .cse3 (not .cse4) .cse5 (< ~local~0 ~token~0)) (and .cse0 .cse4 .cse1 .cse3 (not .cse2) .cse5 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~E_1~0 2)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 (= ~m_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4))) [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L258 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse4 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse10 (not .cse0)) (.cse2 (< 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse9 (<= 2 ~E_M~0)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse7 .cse8 .cse6 .cse9 .cse11) (and .cse1 (= ~m_st~0 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse8 .cse6 .cse9 .cse11) (and .cse10 .cse2 .cse3 .cse5 .cse7 .cse6 .cse9 .cse11)))) [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,173 INFO L262 CegarLoopResult]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L258 CegarLoopResult]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 0))) (let ((.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not .cse7)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 1) .cse3 .cse4 .cse5 .cse6) (and (not .cse0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~t1_st~0 0) .cse2 .cse7 .cse3 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse8)))) [2020-12-09 12:58:27,174 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 12:58:27,174 INFO L258 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (= ~t1_pc~0 1)) (.cse2 (= ~m_pc~0 1)) (.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (not .cse10)) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0)) (.cse11 (= ~m_pc~0 0))) (or (and (or (and .cse0 (= ~m_st~0 ~E_1~0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse6 .cse3 .cse4)) .cse7 .cse8 .cse9) (and .cse7 .cse10 .cse8 .cse9 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse6 .cse11) (and (<= ~token~0 (+ ~local~0 1)) .cse5 .cse2 .cse10 .cse9 (not .cse0) .cse3 (< ~local~0 ~token~0) .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse4 .cse11)))) [2020-12-09 12:58:27,174 INFO L258 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse1 (= ~t1_pc~0 1))) (let ((.cse8 (not .cse1)) (.cse0 (<= 2 ~t1_st~0)) (.cse13 (not .cse3)) (.cse12 (= ~m_pc~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse2 (= ~m_pc~0 1)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) (< ~local~0 ~token~0)) (and .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12) (and .cse8 .cse9 .cse6 .cse13 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse6 .cse4 .cse13 .cse5) (and .cse0 .cse1 .cse10 .cse11 .cse6 .cse4 .cse5 .cse12) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse13 .cse4 .cse5 .cse12) (and .cse1 .cse7 .cse13 .cse4 .cse5 .cse12) (and .cse7 .cse9 (= ~m_st~0 ~E_1~0) .cse10 .cse2 .cse11 .cse6 .cse4 .cse5)))) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= 2 ~E_M~0) (= ~m_pc~0 0)) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse3 (<= 2 ~E_M~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse5 .cse4 .cse3 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (= ~t1_pc~0 1)) (.cse0 (<= ~token~0 ~local~0)) (.cse1 (<= ~local~0 ~token~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= ~m_st~0 0))) (.cse6 (= ~m_pc~0 0))) (or (and (= ~t1_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ~token~0 (+ ~local~0 1)) .cse7 (= ~m_pc~0 1) .cse4 .cse5 .cse2 (not (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) .cse3 (< ~local~0 ~token~0)) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse2 .cse3 .cse6))) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse2 (= ~E_1~0 2))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~E_M~0 1) .cse1 (= ~m_pc~0 1) .cse2 .cse3 (not .cse4) .cse5 (< ~local~0 ~token~0)) (and .cse0 .cse4 .cse1 .cse3 .cse5 .cse2 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0)) (.cse2 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse2 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,175 INFO L258 CegarLoopResult]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2020-12-09 12:58:27,175 INFO L265 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-12-09 12:58:27,175 INFO L262 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-12-09 12:58:27,175 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 12:58:27,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:58:27 BoogieIcfgContainer [2020-12-09 12:58:27,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 12:58:27,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 12:58:27,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 12:58:27,203 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 12:58:27,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:58:23" (3/4) ... [2020-12-09 12:58:27,206 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 12:58:27,217 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2020-12-09 12:58:27,218 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-12-09 12:58:27,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 12:58:27,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 12:58:27,281 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8b55f9a2-bb25-4f4d-9f27-1f247a0334fc/bin/utaipan/witness.graphml [2020-12-09 12:58:27,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 12:58:27,282 INFO L168 Benchmark]: Toolchain (without parser) took 4570.61 ms. Allocated memory was 138.4 MB in the beginning and 218.1 MB in the end (delta: 79.7 MB). Free memory was 117.2 MB in the beginning and 169.5 MB in the end (delta: -52.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,282 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 79.7 MB. Free memory was 54.6 MB in the beginning and 54.6 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:58:27,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.67 ms. Allocated memory is still 138.4 MB. Free memory was 117.2 MB in the beginning and 104.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 101.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,284 INFO L168 Benchmark]: Boogie Preprocessor took 25.76 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 99.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,284 INFO L168 Benchmark]: RCFGBuilder took 751.26 ms. Allocated memory is still 138.4 MB. Free memory was 99.8 MB in the beginning and 100.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 53.5 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,284 INFO L168 Benchmark]: TraceAbstraction took 3480.61 ms. Allocated memory was 138.4 MB in the beginning and 218.1 MB in the end (delta: 79.7 MB). Free memory was 100.9 MB in the beginning and 178.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,285 INFO L168 Benchmark]: Witness Printer took 78.61 ms. Allocated memory is still 218.1 MB. Free memory was 178.9 MB in the beginning and 169.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 12:58:27,287 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 79.7 MB. Free memory was 54.6 MB in the beginning and 54.6 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 196.67 ms. Allocated memory is still 138.4 MB. Free memory was 117.2 MB in the beginning and 104.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 101.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.76 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 99.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 751.26 ms. Allocated memory is still 138.4 MB. Free memory was 99.8 MB in the beginning and 100.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 53.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3480.61 ms. Allocated memory was 138.4 MB in the beginning and 218.1 MB in the end (delta: 79.7 MB). Free memory was 100.9 MB in the beginning and 178.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 16.1 GB. * Witness Printer took 78.61 ms. Allocated memory is still 218.1 MB. Free memory was 178.9 MB in the beginning and 169.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && __retres1 == 0) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) || (((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_st == E_1) && 0 < t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M)) && token <= local) && local <= token) && !(tmp == 0)) || ((((((token <= local && m_st == 0) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((__retres1 == 0 && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) && 2 <= E_M)) || (((((0 < t1_st && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((token <= local + 1 && t1_pc == 1) && E_M == 1) && 0 < t1_st) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) || ((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && m_pc == 0) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || ((((((((!(t1_pc == 1) && __retres1 == 0) && t1_st == 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || ((((t1_pc == 1 && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) && m_pc == 0) || ((((((t1_pc == 1 && __retres1 == 0) && token <= local) && local <= token) && 2 <= E_M) && !(m_st == 0)) && !(tmp == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((__retres1 == 0 && t1_st == 0) && m_pc == t1_pc) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((t1_st == 0 && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) || ((((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token)) || (((((((t1_pc == 1 && token <= local) && local <= token) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((token <= local + 1 && t1_pc == 1) && E_M == 1) && 0 < t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token) || ((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && m_pc == 0) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) || ((((((!(t1_pc == 1) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((__retres1 == 0 && m_st == E_1) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((__retres1 == 0 && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((!(t1_pc == 1) && 0 < t1_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && __retres1 == 0) && token <= local) && local <= token) && 2 <= E_M) && !(m_st == 0)) && !(tmp == 0)) || (((((((__retres1 == 0 && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) || (((((((!(t1_pc == 1) && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((2 <= t1_st && t1_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((2 <= t1_st && t1_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((t1_pc == 1 && __retres1 == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((2 <= t1_st && t1_pc == 1) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0))) || ((((((((__retres1 == 0 && t1_st == 0) && m_st == E_1) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && t1_pc == 1) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) && 2 <= E_M) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((t1_st == 0 && m_pc == t1_pc) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= t1_st && token <= local + 1) && t1_pc == 1) && m_pc == 1) && m_st == 0) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && local < token) || (((((((!(t1_pc == 1) && t1_st == 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((!(t1_pc == 1) && t1_st == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((2 <= t1_st && t1_pc == 1) && m_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && t1_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((2 <= t1_st && t1_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((__retres1 == 0 && t1_st == 0) && m_st == E_1) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1210 SDtfs, 1469 SDslu, 1243 SDs, 0 SdLazy, 455 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 366 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 93 NumberOfFragments, 1584 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5002 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 59746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 240/241 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...