./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/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-a4ecdab [2020-11-22 13:06:26,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 13:06:26,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 13:06:26,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 13:06:26,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 13:06:26,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 13:06:26,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 13:06:26,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 13:06:26,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 13:06:26,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 13:06:26,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 13:06:26,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 13:06:26,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 13:06:26,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 13:06:26,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 13:06:26,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 13:06:26,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 13:06:26,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 13:06:26,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 13:06:26,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 13:06:26,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 13:06:26,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 13:06:26,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 13:06:26,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 13:06:26,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 13:06:26,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 13:06:26,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 13:06:26,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 13:06:26,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 13:06:26,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 13:06:26,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 13:06:26,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 13:06:26,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 13:06:26,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 13:06:26,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 13:06:26,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 13:06:26,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 13:06:26,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 13:06:26,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 13:06:26,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 13:06:26,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 13:06:26,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 13:06:26,973 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 13:06:26,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 13:06:26,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 13:06:26,974 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 13:06:26,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 13:06:26,975 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 13:06:26,975 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 13:06:26,975 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 13:06:26,975 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 13:06:26,976 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 13:06:26,977 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 13:06:26,977 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 13:06:26,977 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 13:06:26,977 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 13:06:26,978 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 13:06:26,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 13:06:26,978 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 13:06:26,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 13:06:26,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 13:06:26,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 13:06:26,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 13:06:26,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 13:06:26,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 13:06:26,980 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 13:06:26,980 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 13:06:26,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 13:06:26,980 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 13:06:26,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 13:06:26,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 13:06:26,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 13:06:26,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 13:06:26,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 13:06:26,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 13:06:26,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 13:06:26,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 13:06:26,983 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 13:06:26,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 13:06:26,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 13:06:26,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 13:06:26,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 13:06:26,983 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_5f996603-d6c5-492e-bb25-0a8fa60e5421/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_5f996603-d6c5-492e-bb25-0a8fa60e5421/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-11-22 13:06:27,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 13:06:27,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 13:06:27,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 13:06:27,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 13:06:27,303 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 13:06:27,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-11-22 13:06:27,373 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/data/9bb4a585a/33d8ea6174c44d0f87f8da350aaf3035/FLAGba4ed4b81 [2020-11-22 13:06:27,795 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 13:06:27,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-11-22 13:06:27,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/data/9bb4a585a/33d8ea6174c44d0f87f8da350aaf3035/FLAGba4ed4b81 [2020-11-22 13:06:28,182 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/data/9bb4a585a/33d8ea6174c44d0f87f8da350aaf3035 [2020-11-22 13:06:28,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 13:06:28,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 13:06:28,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 13:06:28,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 13:06:28,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 13:06:28,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1755e468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28, skipping insertion in model container [2020-11-22 13:06:28,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 13:06:28,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 13:06:28,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:06:28,515 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 13:06:28,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 13:06:28,587 INFO L208 MainTranslator]: Completed translation [2020-11-22 13:06:28,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28 WrapperNode [2020-11-22 13:06:28,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 13:06:28,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 13:06:28,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 13:06:28,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 13:06:28,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 13:06:28,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 13:06:28,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 13:06:28,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 13:06:28,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... [2020-11-22 13:06:28,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 13:06:28,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 13:06:28,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 13:06:28,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 13:06:28,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/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-11-22 13:06:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 13:06:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 13:06:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 13:06:28,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 13:06:30,132 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 13:06:30,132 INFO L298 CfgBuilder]: Removed 82 assume(true) statements. [2020-11-22 13:06:30,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:30 BoogieIcfgContainer [2020-11-22 13:06:30,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 13:06:30,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 13:06:30,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 13:06:30,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 13:06:30,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:06:28" (1/3) ... [2020-11-22 13:06:30,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2fd81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:06:30, skipping insertion in model container [2020-11-22 13:06:30,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:06:28" (2/3) ... [2020-11-22 13:06:30,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2fd81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:06:30, skipping insertion in model container [2020-11-22 13:06:30,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:30" (3/3) ... [2020-11-22 13:06:30,143 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-11-22 13:06:30,153 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 13:06:30,157 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-22 13:06:30,169 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-22 13:06:30,192 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 13:06:30,199 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 13:06:30,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 13:06:30,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 13:06:30,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 13:06:30,200 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 13:06:30,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 13:06:30,200 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 13:06:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-11-22 13:06:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 13:06:30,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:30,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 13:06:30,221 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1837414711, now seen corresponding path program 1 times [2020-11-22 13:06:30,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:30,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139732682] [2020-11-22 13:06:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:30,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139732682] [2020-11-22 13:06:30,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:30,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:30,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924479382] [2020-11-22 13:06:30,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:06:30,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:06:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:06:30,439 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 4 states. [2020-11-22 13:06:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:30,640 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2020-11-22 13:06:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:06:30,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-22 13:06:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:30,662 INFO L225 Difference]: With dead ends: 204 [2020-11-22 13:06:30,666 INFO L226 Difference]: Without dead ends: 137 [2020-11-22 13:06:30,672 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-11-22 13:06:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-22 13:06:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2020-11-22 13:06:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-22 13:06:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2020-11-22 13:06:30,753 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 16 [2020-11-22 13:06:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:30,753 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2020-11-22 13:06:30,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:06:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2020-11-22 13:06:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-22 13:06:30,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:30,756 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-11-22 13:06:30,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 13:06:30,757 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 987577347, now seen corresponding path program 1 times [2020-11-22 13:06:30,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:30,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015059942] [2020-11-22 13:06:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:30,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015059942] [2020-11-22 13:06:30,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:30,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:30,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090185329] [2020-11-22 13:06:30,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:30,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:30,843 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand 3 states. [2020-11-22 13:06:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:30,891 INFO L93 Difference]: Finished difference Result 279 states and 398 transitions. [2020-11-22 13:06:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:30,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-22 13:06:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:30,893 INFO L225 Difference]: With dead ends: 279 [2020-11-22 13:06:30,894 INFO L226 Difference]: Without dead ends: 162 [2020-11-22 13:06:30,895 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-11-22 13:06:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-22 13:06:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2020-11-22 13:06:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-22 13:06:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2020-11-22 13:06:30,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 23 [2020-11-22 13:06:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:30,909 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2020-11-22 13:06:30,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2020-11-22 13:06:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 13:06:30,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:30,911 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-11-22 13:06:30,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 13:06:30,911 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:30,912 INFO L82 PathProgramCache]: Analyzing trace with hash -422914116, now seen corresponding path program 1 times [2020-11-22 13:06:30,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:30,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528988919] [2020-11-22 13:06:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-22 13:06:31,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528988919] [2020-11-22 13:06:31,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:31,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:06:31,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232416309] [2020-11-22 13:06:31,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:31,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:31,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:31,023 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand 3 states. [2020-11-22 13:06:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:31,097 INFO L93 Difference]: Finished difference Result 343 states and 496 transitions. [2020-11-22 13:06:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:31,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-22 13:06:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:31,101 INFO L225 Difference]: With dead ends: 343 [2020-11-22 13:06:31,101 INFO L226 Difference]: Without dead ends: 235 [2020-11-22 13:06:31,101 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-11-22 13:06:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-22 13:06:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 193. [2020-11-22 13:06:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-22 13:06:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2020-11-22 13:06:31,126 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 24 [2020-11-22 13:06:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:31,127 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2020-11-22 13:06:31,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2020-11-22 13:06:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-22 13:06:31,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:31,134 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-11-22 13:06:31,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 13:06:31,134 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:31,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1718081271, now seen corresponding path program 1 times [2020-11-22 13:06:31,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:31,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395401548] [2020-11-22 13:06:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:31,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395401548] [2020-11-22 13:06:31,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:31,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:31,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492363075] [2020-11-22 13:06:31,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:31,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:31,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:31,247 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 3 states. [2020-11-22 13:06:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:31,291 INFO L93 Difference]: Finished difference Result 313 states and 447 transitions. [2020-11-22 13:06:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:31,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-11-22 13:06:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:31,293 INFO L225 Difference]: With dead ends: 313 [2020-11-22 13:06:31,293 INFO L226 Difference]: Without dead ends: 204 [2020-11-22 13:06:31,294 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-11-22 13:06:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-11-22 13:06:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2020-11-22 13:06:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-11-22 13:06:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 263 transitions. [2020-11-22 13:06:31,313 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 263 transitions. Word has length 42 [2020-11-22 13:06:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:31,314 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 263 transitions. [2020-11-22 13:06:31,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 263 transitions. [2020-11-22 13:06:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-22 13:06:31,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:31,316 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-11-22 13:06:31,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 13:06:31,316 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1436534314, now seen corresponding path program 1 times [2020-11-22 13:06:31,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:31,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72097609] [2020-11-22 13:06:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-22 13:06:31,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72097609] [2020-11-22 13:06:31,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:31,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:31,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533711992] [2020-11-22 13:06:31,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:06:31,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:31,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:06:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:06:31,400 INFO L87 Difference]: Start difference. First operand 193 states and 263 transitions. Second operand 4 states. [2020-11-22 13:06:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:31,501 INFO L93 Difference]: Finished difference Result 628 states and 853 transitions. [2020-11-22 13:06:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:06:31,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-11-22 13:06:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:31,504 INFO L225 Difference]: With dead ends: 628 [2020-11-22 13:06:31,504 INFO L226 Difference]: Without dead ends: 442 [2020-11-22 13:06:31,505 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-11-22 13:06:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-22 13:06:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 334. [2020-11-22 13:06:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-11-22 13:06:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 442 transitions. [2020-11-22 13:06:31,543 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 442 transitions. Word has length 42 [2020-11-22 13:06:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:31,544 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 442 transitions. [2020-11-22 13:06:31,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:06:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 442 transitions. [2020-11-22 13:06:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-22 13:06:31,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:31,549 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-11-22 13:06:31,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 13:06:31,549 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1634655123, now seen corresponding path program 1 times [2020-11-22 13:06:31,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:31,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220465375] [2020-11-22 13:06:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:31,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220465375] [2020-11-22 13:06:31,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:31,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:06:31,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152694763] [2020-11-22 13:06:31,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:06:31,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:06:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:06:31,643 INFO L87 Difference]: Start difference. First operand 334 states and 442 transitions. Second operand 5 states. [2020-11-22 13:06:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:31,785 INFO L93 Difference]: Finished difference Result 615 states and 818 transitions. [2020-11-22 13:06:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 13:06:31,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-11-22 13:06:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:31,788 INFO L225 Difference]: With dead ends: 615 [2020-11-22 13:06:31,788 INFO L226 Difference]: Without dead ends: 288 [2020-11-22 13:06:31,789 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-11-22 13:06:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-11-22 13:06:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 259. [2020-11-22 13:06:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-11-22 13:06:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 343 transitions. [2020-11-22 13:06:31,807 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 343 transitions. Word has length 43 [2020-11-22 13:06:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:31,807 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 343 transitions. [2020-11-22 13:06:31,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:06:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 343 transitions. [2020-11-22 13:06:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-22 13:06:31,814 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:31,814 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-11-22 13:06:31,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 13:06:31,814 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash -798528443, now seen corresponding path program 1 times [2020-11-22 13:06:31,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:31,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987802825] [2020-11-22 13:06:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:31,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987802825] [2020-11-22 13:06:31,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:31,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 13:06:31,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006708371] [2020-11-22 13:06:31,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 13:06:31,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 13:06:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 13:06:31,925 INFO L87 Difference]: Start difference. First operand 259 states and 343 transitions. Second operand 5 states. [2020-11-22 13:06:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:32,052 INFO L93 Difference]: Finished difference Result 569 states and 753 transitions. [2020-11-22 13:06:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 13:06:32,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-11-22 13:06:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:32,055 INFO L225 Difference]: With dead ends: 569 [2020-11-22 13:06:32,055 INFO L226 Difference]: Without dead ends: 318 [2020-11-22 13:06:32,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:06:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-11-22 13:06:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2020-11-22 13:06:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-11-22 13:06:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 337 transitions. [2020-11-22 13:06:32,072 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 337 transitions. Word has length 45 [2020-11-22 13:06:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:32,073 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 337 transitions. [2020-11-22 13:06:32,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 13:06:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 337 transitions. [2020-11-22 13:06:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-22 13:06:32,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:32,075 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-11-22 13:06:32,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 13:06:32,076 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1868952122, now seen corresponding path program 1 times [2020-11-22 13:06:32,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:32,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779725848] [2020-11-22 13:06:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:32,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779725848] [2020-11-22 13:06:32,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:32,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:32,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67900948] [2020-11-22 13:06:32,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:32,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:32,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:32,153 INFO L87 Difference]: Start difference. First operand 259 states and 337 transitions. Second operand 3 states. [2020-11-22 13:06:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:32,196 INFO L93 Difference]: Finished difference Result 429 states and 561 transitions. [2020-11-22 13:06:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:32,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-11-22 13:06:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:32,201 INFO L225 Difference]: With dead ends: 429 [2020-11-22 13:06:32,202 INFO L226 Difference]: Without dead ends: 178 [2020-11-22 13:06:32,203 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-11-22 13:06:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-22 13:06:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2020-11-22 13:06:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-22 13:06:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2020-11-22 13:06:32,216 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 45 [2020-11-22 13:06:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:32,216 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2020-11-22 13:06:32,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2020-11-22 13:06:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-22 13:06:32,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:32,218 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-11-22 13:06:32,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 13:06:32,218 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 922405495, now seen corresponding path program 1 times [2020-11-22 13:06:32,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:32,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764186398] [2020-11-22 13:06:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-22 13:06:32,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764186398] [2020-11-22 13:06:32,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:32,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 13:06:32,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745239326] [2020-11-22 13:06:32,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:32,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:32,293 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand 3 states. [2020-11-22 13:06:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:32,324 INFO L93 Difference]: Finished difference Result 251 states and 308 transitions. [2020-11-22 13:06:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:32,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-22 13:06:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:32,327 INFO L225 Difference]: With dead ends: 251 [2020-11-22 13:06:32,327 INFO L226 Difference]: Without dead ends: 173 [2020-11-22 13:06:32,328 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-11-22 13:06:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-22 13:06:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-22 13:06:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-22 13:06:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 207 transitions. [2020-11-22 13:06:32,340 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 207 transitions. Word has length 46 [2020-11-22 13:06:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:32,340 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 207 transitions. [2020-11-22 13:06:32,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 207 transitions. [2020-11-22 13:06:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-22 13:06:32,344 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:32,344 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-11-22 13:06:32,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 13:06:32,344 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1950985720, now seen corresponding path program 1 times [2020-11-22 13:06:32,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:32,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749716541] [2020-11-22 13:06:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:32,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749716541] [2020-11-22 13:06:32,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464456009] [2020-11-22 13:06:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/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-11-22 13:06:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:32,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-22 13:06:32,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-22 13:06:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:32,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-22 13:06:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 13:06:32,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-22 13:06:32,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-11-22 13:06:32,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818187857] [2020-11-22 13:06:32,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:06:32,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:32,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:06:32,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:06:32,675 INFO L87 Difference]: Start difference. First operand 173 states and 207 transitions. Second operand 4 states. [2020-11-22 13:06:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:32,731 INFO L93 Difference]: Finished difference Result 359 states and 432 transitions. [2020-11-22 13:06:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:06:32,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-11-22 13:06:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:32,733 INFO L225 Difference]: With dead ends: 359 [2020-11-22 13:06:32,733 INFO L226 Difference]: Without dead ends: 226 [2020-11-22 13:06:32,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-22 13:06:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-11-22 13:06:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2020-11-22 13:06:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-22 13:06:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2020-11-22 13:06:32,761 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 47 [2020-11-22 13:06:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:32,762 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2020-11-22 13:06:32,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:06:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2020-11-22 13:06:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-22 13:06:32,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:32,763 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-11-22 13:06:32,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-22 13:06:32,989 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1233357488, now seen corresponding path program 1 times [2020-11-22 13:06:32,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:32,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300557772] [2020-11-22 13:06:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-22 13:06:33,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300557772] [2020-11-22 13:06:33,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:33,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 13:06:33,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672629124] [2020-11-22 13:06:33,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:06:33,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:33,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:06:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:06:33,076 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand 6 states. [2020-11-22 13:06:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:33,293 INFO L93 Difference]: Finished difference Result 342 states and 413 transitions. [2020-11-22 13:06:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-22 13:06:33,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-11-22 13:06:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:33,294 INFO L225 Difference]: With dead ends: 342 [2020-11-22 13:06:33,294 INFO L226 Difference]: Without dead ends: 130 [2020-11-22 13:06:33,295 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-11-22 13:06:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-22 13:06:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2020-11-22 13:06:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-22 13:06:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2020-11-22 13:06:33,306 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 47 [2020-11-22 13:06:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:33,307 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2020-11-22 13:06:33,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:06:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2020-11-22 13:06:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-22 13:06:33,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:33,308 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-11-22 13:06:33,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 13:06:33,308 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1083391764, now seen corresponding path program 1 times [2020-11-22 13:06:33,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:33,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342093298] [2020-11-22 13:06:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-22 13:06:33,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342093298] [2020-11-22 13:06:33,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:33,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 13:06:33,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343322868] [2020-11-22 13:06:33,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 13:06:33,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 13:06:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 13:06:33,433 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2020-11-22 13:06:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:33,471 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2020-11-22 13:06:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-22 13:06:33,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-11-22 13:06:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:33,473 INFO L225 Difference]: With dead ends: 208 [2020-11-22 13:06:33,473 INFO L226 Difference]: Without dead ends: 206 [2020-11-22 13:06:33,474 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-11-22 13:06:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-11-22 13:06:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 163. [2020-11-22 13:06:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-11-22 13:06:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2020-11-22 13:06:33,488 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 48 [2020-11-22 13:06:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:33,488 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2020-11-22 13:06:33,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 13:06:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2020-11-22 13:06:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-22 13:06:33,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:33,489 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-11-22 13:06:33,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 13:06:33,490 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash 127596564, now seen corresponding path program 1 times [2020-11-22 13:06:33,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:33,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855247091] [2020-11-22 13:06:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-22 13:06:33,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855247091] [2020-11-22 13:06:33,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:33,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 13:06:33,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542381707] [2020-11-22 13:06:33,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 13:06:33,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 13:06:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-22 13:06:33,613 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2020-11-22 13:06:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:33,778 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2020-11-22 13:06:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 13:06:33,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-11-22 13:06:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:33,780 INFO L225 Difference]: With dead ends: 290 [2020-11-22 13:06:33,780 INFO L226 Difference]: Without dead ends: 172 [2020-11-22 13:06:33,781 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-11-22 13:06:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-22 13:06:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2020-11-22 13:06:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-11-22 13:06:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2020-11-22 13:06:33,795 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 78 [2020-11-22 13:06:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:33,795 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2020-11-22 13:06:33,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 13:06:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2020-11-22 13:06:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-22 13:06:33,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 13:06:33,796 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-11-22 13:06:33,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 13:06:33,797 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 13:06:33,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 13:06:33,797 INFO L82 PathProgramCache]: Analyzing trace with hash -941349466, now seen corresponding path program 1 times [2020-11-22 13:06:33,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 13:06:33,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112139991] [2020-11-22 13:06:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 13:06:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 13:06:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-22 13:06:33,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112139991] [2020-11-22 13:06:33,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 13:06:33,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 13:06:33,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584595797] [2020-11-22 13:06:33,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 13:06:33,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 13:06:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 13:06:33,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 13:06:33,834 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 3 states. [2020-11-22 13:06:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 13:06:33,866 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2020-11-22 13:06:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 13:06:33,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-11-22 13:06:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 13:06:33,866 INFO L225 Difference]: With dead ends: 220 [2020-11-22 13:06:33,867 INFO L226 Difference]: Without dead ends: 0 [2020-11-22 13:06:33,867 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-11-22 13:06:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-22 13:06:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-22 13:06:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-22 13:06:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-22 13:06:33,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-11-22 13:06:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 13:06:33,868 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-22 13:06:33,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 13:06:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-22 13:06:33,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-22 13:06:33,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 13:06:33,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-22 13:06:34,287 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-22 13:06:34,600 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-11-22 13:06:34,706 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2020-11-22 13:06:35,735 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-11-22 13:06:36,097 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-11-22 13:06:36,126 INFO L274 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,126 INFO L274 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2020-11-22 13:06:36,127 INFO L274 CegarLoopResult]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2020-11-22 13:06:36,128 INFO L274 CegarLoopResult]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2020-11-22 13:06:36,128 INFO L274 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-11-22 13:06:36,128 INFO L270 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-11-22 13:06:36,128 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-11-22 13:06:36,128 INFO L274 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-11-22 13:06:36,128 INFO L270 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-11-22 13:06:36,129 INFO L270 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-11-22 13:06:36,129 INFO L270 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (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 .cse1 .cse3 (= ~m_pc~0 0)))) [2020-11-22 13:06:36,129 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-22 13:06:36,129 INFO L270 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)) (.cse9 (<= 2 ~t1_st~0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse8 (<= ~local~0 ~token~0)) (.cse4 (= ~E_1~0 2)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not .cse13)) (.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 .cse11 .cse1 .cse12 .cse7 .cse8 .cse4 .cse2 .cse3 .cse5) (and .cse9 .cse10 .cse12 .cse7 .cse8 .cse4 .cse3 .cse5 .cse2) (and .cse9 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse12 .cse13 .cse2 (not .cse11) .cse4 (< ~local~0 ~token~0) .cse5) (and .cse10 .cse11 .cse7 .cse12 .cse8 .cse4 .cse2 .cse3 .cse5)))) [2020-11-22 13:06:36,129 INFO L270 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-11-22 13:06:36,130 INFO L270 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-11-22 13:06:36,130 INFO L274 CegarLoopResult]: For program point L80(lines 80 88) no Hoare annotation was computed. [2020-11-22 13:06:36,130 INFO L270 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-11-22 13:06:36,130 INFO L270 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-11-22 13:06:36,130 INFO L270 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-11-22 13:06:36,130 INFO L274 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-11-22 13:06:36,130 INFO L274 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L270 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse1 (< 0 ~t1_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 (= ~m_pc~0 1) .cse8 .cse5 .cse2 .cse4 .cse3) (and .cse9 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6) (and .cse9 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6))) [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2020-11-22 13:06:36,131 INFO L274 CegarLoopResult]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2020-11-22 13:06:36,132 INFO L274 CegarLoopResult]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2020-11-22 13:06:36,132 INFO L274 CegarLoopResult]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2020-11-22 13:06:36,132 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-22 13:06:36,132 INFO L274 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-11-22 13:06:36,132 INFO L270 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-11-22 13:06:36,132 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-22 13:06:36,132 INFO L270 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 0))) (let ((.cse5 (= ~m_pc~0 0)) (.cse9 (= ~t1_pc~0 1)) (.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (< 0 ~t1_st~0)) (.cse10 (= ~m_pc~0 1)) (.cse2 (= ~E_1~0 2)) (.cse4 (not .cse7)) (.cse3 (<= 2 ~E_M~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5) (and (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse7 .cse1 (not .cse0) .cse2 (< ~local~0 ~token~0) .cse3) (and .cse11 .cse1 .cse4 .cse2 .cse3 .cse5) (and (or (and .cse9 .cse0 .cse10 .cse4 .cse2 .cse3) (and .cse0 .cse11 .cse10 .cse2 .cse4 .cse3)) .cse6 .cse8 .cse1)))) [2020-11-22 13:06:36,133 INFO L270 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)) (.cse9 (= ~t1_st~0 0)) (.cse2 (= ~m_pc~0 1)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (not .cse3)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= ~m_pc~0 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 .cse7 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse13 .cse5) (and .cse1 .cse7 .cse13 .cse4 .cse5 .cse12)))) [2020-11-22 13:06:36,133 INFO L270 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-11-22 13:06:36,133 INFO L270 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-11-22 13:06:36,133 INFO L270 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-11-22 13:06:36,134 INFO L270 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-11-22 13:06:36,134 INFO L270 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 (<= 2 ~E_M~0)) (.cse2 (= ~E_1~0 2)) (.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) .cse3 .cse2 .cse4))) [2020-11-22 13:06:36,134 INFO L270 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-11-22 13:06:36,134 INFO L277 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-11-22 13:06:36,134 INFO L274 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-11-22 13:06:36,134 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-22 13:06:36,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:06:36 BoogieIcfgContainer [2020-11-22 13:06:36,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 13:06:36,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 13:06:36,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 13:06:36,201 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 13:06:36,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:06:30" (3/4) ... [2020-11-22 13:06:36,204 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-22 13:06:36,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2020-11-22 13:06:36,230 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-11-22 13:06:36,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-22 13:06:36,233 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-22 13:06:36,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5f996603-d6c5-492e-bb25-0a8fa60e5421/bin/utaipan/witness.graphml [2020-11-22 13:06:36,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 13:06:36,368 INFO L168 Benchmark]: Toolchain (without parser) took 8181.38 ms. Allocated memory was 92.3 MB in the beginning and 167.8 MB in the end (delta: 75.5 MB). Free memory was 62.6 MB in the beginning and 63.2 MB in the end (delta: -551.1 kB). Peak memory consumption was 74.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,368 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 92.3 MB. Free memory is still 50.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 13:06:36,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.76 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 66.5 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.67 ms. Allocated memory is still 92.3 MB. Free memory was 66.2 MB in the beginning and 63.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,369 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 ms. Allocated memory is still 92.3 MB. Free memory was 63.9 MB in the beginning and 61.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,370 INFO L168 Benchmark]: RCFGBuilder took 1452.68 ms. Allocated memory was 92.3 MB in the beginning and 115.3 MB in the end (delta: 23.1 MB). Free memory was 61.8 MB in the beginning and 40.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,370 INFO L168 Benchmark]: TraceAbstraction took 6064.19 ms. Allocated memory was 115.3 MB in the beginning and 167.8 MB in the end (delta: 52.4 MB). Free memory was 40.0 MB in the beginning and 72.6 MB in the end (delta: -32.6 MB). Peak memory consumption was 53.5 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,370 INFO L168 Benchmark]: Witness Printer took 166.43 ms. Allocated memory is still 167.8 MB. Free memory was 72.6 MB in the beginning and 63.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-22 13:06:36,372 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.17 ms. Allocated memory is still 92.3 MB. Free memory is still 50.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.76 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 66.5 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.67 ms. Allocated memory is still 92.3 MB. Free memory was 66.2 MB in the beginning and 63.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.46 ms. Allocated memory is still 92.3 MB. Free memory was 63.9 MB in the beginning and 61.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1452.68 ms. Allocated memory was 92.3 MB in the beginning and 115.3 MB in the end (delta: 23.1 MB). Free memory was 61.8 MB in the beginning and 40.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6064.19 ms. Allocated memory was 115.3 MB in the beginning and 167.8 MB in the end (delta: 52.4 MB). Free memory was 40.0 MB in the beginning and 72.6 MB in the end (delta: -32.6 MB). Peak memory consumption was 53.5 MB. Max. memory is 16.1 GB. * Witness Printer took 166.43 ms. Allocated memory is still 167.8 MB. Free memory was 72.6 MB in the beginning and 63.2 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: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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 && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) || ((((((token <= local && m_st == 0) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && 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)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((__retres1 == 0 && 0 < t1_st) && m_pc == 1) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M)) && token <= local) && local <= token) && !(tmp == 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) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) || ((((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) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) || (((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && token <= local) && local <= token) && 2 <= E_M) && E_1 == 2) && !(m_st == 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: ((((((((__retres1 == 0 && 0 < t1_st) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && m_pc == 0) || ((((((((__retres1 == 0 && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && 2 <= E_M) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2)) || ((((((!(t1_pc == 1) && 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)) || ((((((((__retres1 == 0 && t1_st == 0) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M)) || ((((((((2 <= t1_st && t1_pc == 1) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0))) || (((((((((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)) || ((((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 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)) || ((((((((__retres1 == 0 && t1_st == 0) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 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: (((((((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: 3.6s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1221 SDtfs, 1440 SDslu, 1315 SDs, 0 SdLazy, 464 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 392 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 93 NumberOfFragments, 1555 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5282 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 59092 SizeOfPredicates, 1 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...