./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf623cbfa27d5f25c20ae418fc6508fd949965cd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:44:31,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:44:31,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:44:31,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:44:31,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:44:31,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:44:31,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:44:31,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:44:31,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:44:31,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:44:31,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:44:31,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:44:31,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:44:31,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:44:31,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:44:31,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:44:31,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:44:31,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:44:31,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:44:31,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:44:31,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:44:31,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:44:31,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:44:31,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:44:31,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:44:31,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:44:31,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:44:31,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:44:31,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:44:31,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:44:31,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:44:31,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:44:31,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:44:31,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:44:31,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:44:31,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:44:31,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:44:31,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:44:31,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:44:31,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:44:31,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:44:31,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:44:31,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:44:31,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:44:31,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:44:31,959 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:44:31,959 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:44:31,959 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:44:31,959 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:44:31,960 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:44:31,960 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:44:31,960 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:44:31,960 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:44:31,960 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:44:31,961 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:44:31,961 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:44:31,961 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:44:31,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:44:31,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:44:31,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:44:31,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:44:31,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:44:31,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:44:31,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:44:31,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:44:31,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:44:31,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:44:31,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:44:31,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:44:31,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:44:31,965 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:44:31,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:44:31,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:44:31,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:44:31,976 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf623cbfa27d5f25c20ae418fc6508fd949965cd [2019-11-26 02:44:32,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:44:32,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:44:32,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:44:32,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:44:32,157 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:44:32,158 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-26 02:44:32,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/data/a2837453b/fc1c790690f74ed8a368cc75fdf4704e/FLAGbfbcddeba [2019-11-26 02:44:32,726 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:44:32,726 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-11-26 02:44:32,739 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/data/a2837453b/fc1c790690f74ed8a368cc75fdf4704e/FLAGbfbcddeba [2019-11-26 02:44:33,228 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/data/a2837453b/fc1c790690f74ed8a368cc75fdf4704e [2019-11-26 02:44:33,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:44:33,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:44:33,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:33,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:44:33,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:44:33,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b4ff5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33, skipping insertion in model container [2019-11-26 02:44:33,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:44:33,314 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:44:33,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:33,754 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:44:33,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:33,838 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:44:33,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33 WrapperNode [2019-11-26 02:44:33,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:33,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:33,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:44:33,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:44:33,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:33,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:44:33,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:44:33,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:44:33,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... [2019-11-26 02:44:33,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:44:33,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:44:33,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:44:33,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:44:33,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:44:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:44:34,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:44:36,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:44:36,058 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:44:36,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:36 BoogieIcfgContainer [2019-11-26 02:44:36,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:44:36,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:44:36,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:44:36,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:44:36,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:44:33" (1/3) ... [2019-11-26 02:44:36,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35428dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:36, skipping insertion in model container [2019-11-26 02:44:36,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:33" (2/3) ... [2019-11-26 02:44:36,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35428dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:36, skipping insertion in model container [2019-11-26 02:44:36,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:36" (3/3) ... [2019-11-26 02:44:36,068 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-11-26 02:44:36,077 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:44:36,083 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:44:36,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:44:36,115 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:44:36,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:44:36,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:44:36,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:44:36,116 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:44:36,116 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:44:36,116 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:44:36,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:44:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:44:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:44:36,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:36,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:36,140 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 925957647, now seen corresponding path program 1 times [2019-11-26 02:44:36,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:36,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845276279] [2019-11-26 02:44:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:36,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845276279] [2019-11-26 02:44:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:36,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:36,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627875826] [2019-11-26 02:44:36,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:36,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:36,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:36,539 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:44:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:37,351 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:44:37,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:37,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:44:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:37,376 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:44:37,377 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:44:37,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:44:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:44:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:44:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-26 02:44:37,464 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-26 02:44:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:37,465 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-26 02:44:37,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-26 02:44:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:44:37,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:37,470 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:37,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash 221758126, now seen corresponding path program 1 times [2019-11-26 02:44:37,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:37,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598554235] [2019-11-26 02:44:37,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:37,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598554235] [2019-11-26 02:44:37,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:37,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:37,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317594593] [2019-11-26 02:44:37,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:37,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:37,558 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-26 02:44:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:38,149 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-26 02:44:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:38,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-26 02:44:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:38,153 INFO L225 Difference]: With dead ends: 807 [2019-11-26 02:44:38,153 INFO L226 Difference]: Without dead ends: 565 [2019-11-26 02:44:38,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-26 02:44:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-26 02:44:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-26 02:44:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-26 02:44:38,180 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-26 02:44:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:38,180 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-26 02:44:38,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-26 02:44:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:44:38,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:38,185 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:38,185 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash -875187101, now seen corresponding path program 1 times [2019-11-26 02:44:38,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263817961] [2019-11-26 02:44:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:38,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263817961] [2019-11-26 02:44:38,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:38,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:38,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837406986] [2019-11-26 02:44:38,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:38,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:38,268 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-26 02:44:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:38,874 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-26 02:44:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:38,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-26 02:44:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:38,882 INFO L225 Difference]: With dead ends: 1445 [2019-11-26 02:44:38,882 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:44:38,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:44:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-26 02:44:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:44:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1447 transitions. [2019-11-26 02:44:38,919 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1447 transitions. Word has length 102 [2019-11-26 02:44:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:38,919 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1447 transitions. [2019-11-26 02:44:38,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1447 transitions. [2019-11-26 02:44:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:44:38,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:38,925 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:38,925 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash 11623352, now seen corresponding path program 1 times [2019-11-26 02:44:38,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:38,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542090540] [2019-11-26 02:44:38,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:38,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542090540] [2019-11-26 02:44:38,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:38,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:44:38,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069274026] [2019-11-26 02:44:38,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:38,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:38,994 INFO L87 Difference]: Start difference. First operand 883 states and 1447 transitions. Second operand 3 states. [2019-11-26 02:44:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:39,476 INFO L93 Difference]: Finished difference Result 2165 states and 3504 transitions. [2019-11-26 02:44:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:39,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-26 02:44:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:39,487 INFO L225 Difference]: With dead ends: 2165 [2019-11-26 02:44:39,487 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:44:39,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:44:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1203. [2019-11-26 02:44:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-26 02:44:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1719 transitions. [2019-11-26 02:44:39,528 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1719 transitions. Word has length 102 [2019-11-26 02:44:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:39,529 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1719 transitions. [2019-11-26 02:44:39,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1719 transitions. [2019-11-26 02:44:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:44:39,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:39,533 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:39,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2118167535, now seen corresponding path program 1 times [2019-11-26 02:44:39,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:39,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978637366] [2019-11-26 02:44:39,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:44:39,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978637366] [2019-11-26 02:44:39,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:39,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:39,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750182750] [2019-11-26 02:44:39,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:39,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:39,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:39,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:39,680 INFO L87 Difference]: Start difference. First operand 1203 states and 1719 transitions. Second operand 4 states. [2019-11-26 02:44:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:40,287 INFO L93 Difference]: Finished difference Result 2725 states and 3887 transitions. [2019-11-26 02:44:40,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:40,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-26 02:44:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:40,296 INFO L225 Difference]: With dead ends: 2725 [2019-11-26 02:44:40,296 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:44:40,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:44:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-26 02:44:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-26 02:44:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1541 transitions. [2019-11-26 02:44:40,328 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1541 transitions. Word has length 107 [2019-11-26 02:44:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:40,329 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1541 transitions. [2019-11-26 02:44:40,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1541 transitions. [2019-11-26 02:44:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-26 02:44:40,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:40,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:40,333 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2102869639, now seen corresponding path program 1 times [2019-11-26 02:44:40,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:40,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515063250] [2019-11-26 02:44:40,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:40,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515063250] [2019-11-26 02:44:40,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:40,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:44:40,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620963143] [2019-11-26 02:44:40,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:44:40,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:44:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:44:40,772 INFO L87 Difference]: Start difference. First operand 1283 states and 1541 transitions. Second operand 8 states. [2019-11-26 02:44:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:41,685 INFO L93 Difference]: Finished difference Result 2828 states and 3388 transitions. [2019-11-26 02:44:41,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:44:41,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-11-26 02:44:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:41,693 INFO L225 Difference]: With dead ends: 2828 [2019-11-26 02:44:41,693 INFO L226 Difference]: Without dead ends: 1386 [2019-11-26 02:44:41,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:44:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-11-26 02:44:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1203. [2019-11-26 02:44:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-26 02:44:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1441 transitions. [2019-11-26 02:44:41,730 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1441 transitions. Word has length 148 [2019-11-26 02:44:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:41,731 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1441 transitions. [2019-11-26 02:44:41,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:44:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1441 transitions. [2019-11-26 02:44:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-26 02:44:41,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:41,735 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:41,736 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1933242070, now seen corresponding path program 1 times [2019-11-26 02:44:41,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:41,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234249306] [2019-11-26 02:44:41,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:41,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234249306] [2019-11-26 02:44:41,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:41,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:41,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17041801] [2019-11-26 02:44:41,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:41,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:41,908 INFO L87 Difference]: Start difference. First operand 1203 states and 1441 transitions. Second operand 4 states. [2019-11-26 02:44:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:42,436 INFO L93 Difference]: Finished difference Result 2245 states and 2690 transitions. [2019-11-26 02:44:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:42,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-26 02:44:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:42,441 INFO L225 Difference]: With dead ends: 2245 [2019-11-26 02:44:42,441 INFO L226 Difference]: Without dead ends: 883 [2019-11-26 02:44:42,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-11-26 02:44:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-11-26 02:44:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:44:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1004 transitions. [2019-11-26 02:44:42,462 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1004 transitions. Word has length 157 [2019-11-26 02:44:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:42,462 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1004 transitions. [2019-11-26 02:44:42,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1004 transitions. [2019-11-26 02:44:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-26 02:44:42,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:42,466 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:42,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1296453692, now seen corresponding path program 1 times [2019-11-26 02:44:42,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:42,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281595758] [2019-11-26 02:44:42,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:44:42,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281595758] [2019-11-26 02:44:42,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:42,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:44:42,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97665403] [2019-11-26 02:44:42,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:42,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:42,606 INFO L87 Difference]: Start difference. First operand 883 states and 1004 transitions. Second operand 3 states. [2019-11-26 02:44:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:42,853 INFO L93 Difference]: Finished difference Result 1925 states and 2194 transitions. [2019-11-26 02:44:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:42,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-26 02:44:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:42,858 INFO L225 Difference]: With dead ends: 1925 [2019-11-26 02:44:42,858 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:44:42,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:44:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-26 02:44:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:44:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1177 transitions. [2019-11-26 02:44:42,880 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1177 transitions. Word has length 178 [2019-11-26 02:44:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:42,880 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1177 transitions. [2019-11-26 02:44:42,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1177 transitions. [2019-11-26 02:44:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-26 02:44:42,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:42,885 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-26 02:44:42,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1782733256, now seen corresponding path program 1 times [2019-11-26 02:44:42,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:42,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716136701] [2019-11-26 02:44:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-26 02:44:42,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716136701] [2019-11-26 02:44:42,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:42,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:44:42,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340767984] [2019-11-26 02:44:42,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:42,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:42,987 INFO L87 Difference]: Start difference. First operand 1043 states and 1177 transitions. Second operand 4 states. [2019-11-26 02:44:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:43,444 INFO L93 Difference]: Finished difference Result 2325 states and 2612 transitions. [2019-11-26 02:44:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:43,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-26 02:44:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:43,450 INFO L225 Difference]: With dead ends: 2325 [2019-11-26 02:44:43,450 INFO L226 Difference]: Without dead ends: 1123 [2019-11-26 02:44:43,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-26 02:44:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 883. [2019-11-26 02:44:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:44:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 949 transitions. [2019-11-26 02:44:43,472 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 949 transitions. Word has length 236 [2019-11-26 02:44:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:43,473 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 949 transitions. [2019-11-26 02:44:43,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 949 transitions. [2019-11-26 02:44:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-26 02:44:43,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:43,477 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:43,478 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 933528899, now seen corresponding path program 1 times [2019-11-26 02:44:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:43,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581852552] [2019-11-26 02:44:43,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 61 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-26 02:44:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581852552] [2019-11-26 02:44:43,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979228457] [2019-11-26 02:44:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:44:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:44,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:44:44,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-26 02:44:44,182 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-26 02:44:44,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:44:44,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 11 [2019-11-26 02:44:44,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639074912] [2019-11-26 02:44:44,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:44,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:44:44,253 INFO L87 Difference]: Start difference. First operand 883 states and 949 transitions. Second operand 4 states. [2019-11-26 02:44:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:44,558 INFO L93 Difference]: Finished difference Result 1523 states and 1640 transitions. [2019-11-26 02:44:44,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:44,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-26 02:44:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:44,559 INFO L225 Difference]: With dead ends: 1523 [2019-11-26 02:44:44,559 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:44:44,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:44:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:44:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:44:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:44:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:44:44,561 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2019-11-26 02:44:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:44,562 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:44:44,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:44:44,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:44:44,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:44:44,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:44:45,254 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-11-26 02:44:45,600 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:44:45,603 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:44:45,604 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:44:45,605 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:44:45,606 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:44:45,607 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:44:45,607 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a17~0 8)) (.cse11 (= ~a28~0 11))) (let ((.cse1 (<= ~a17~0 7)) (.cse6 (= ~a28~0 10)) (.cse10 (not .cse11)) (.cse8 (or (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 (= ~a28~0 7) (= ~a21~0 1)) (= ~a11~0 1))) (.cse2 (<= ~a19~0 0)) (.cse7 (not .cse3)) (.cse5 (not .cse0)) (.cse4 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse4) (and (not .cse4) .cse7 .cse9 .cse5 .cse10) (and .cse9 .cse3 .cse5 .cse10) (and .cse0 .cse4 .cse9) (and .cse7 .cse9 .cse5 .cse10 .cse8) (and .cse2 .cse7 .cse9 .cse5) (and .cse11 .cse4 .cse3)))) [2019-11-26 02:44:45,607 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:44:45,607 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:44:45,607 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:44:45,607 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:44:45,607 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a17~0 8)) (.cse11 (= ~a28~0 7)) (.cse12 (= ~a21~0 1)) (.cse13 (= ~a28~0 11))) (let ((.cse1 (<= ~a17~0 7)) (.cse6 (= ~a28~0 10)) (.cse10 (not .cse13)) (.cse8 (or (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 .cse11 .cse12) (= ~a11~0 1))) (.cse2 (<= ~a19~0 0)) (.cse7 (not .cse3)) (.cse5 (not .cse0)) (.cse4 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 .cse5) (and .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse4) (and (not .cse4) .cse7 .cse9 .cse5 .cse10) (and .cse9 .cse3 .cse5 .cse10) (and .cse9 .cse11 .cse12 (<= ~a25~0 0)) (and .cse0 .cse4 .cse9) (and .cse7 .cse9 .cse5 .cse10 .cse8) (and .cse2 .cse7 .cse9 .cse5) (and .cse13 .cse4 .cse3)))) [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:44:45,608 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:44:45,609 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:44:45,609 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:44:45,613 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:44:45,614 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:44:45,615 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:44:45,616 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:44:45,617 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:44:45,617 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:44:45,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:44:45 BoogieIcfgContainer [2019-11-26 02:44:45,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:44:45,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:44:45,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:44:45,658 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:44:45,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:36" (3/4) ... [2019-11-26 02:44:45,661 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:44:45,690 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-11-26 02:44:45,692 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:44:45,694 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:44:45,695 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:44:45,904 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f87449cc-04ff-4e6e-8a2c-3f2c4427ad44/bin/utaipan/witness.graphml [2019-11-26 02:44:45,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:44:45,905 INFO L168 Benchmark]: Toolchain (without parser) took 12673.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 939.4 MB in the beginning and 917.8 MB in the end (delta: 21.6 MB). Peak memory consumption was 495.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,906 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:44:45,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:44:45,907 INFO L168 Benchmark]: Boogie Preprocessor took 63.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,909 INFO L168 Benchmark]: RCFGBuilder took 2084.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.1 MB in the end (delta: 229.5 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,909 INFO L168 Benchmark]: TraceAbstraction took 9595.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 910.1 MB in the beginning and 945.8 MB in the end (delta: -35.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,910 INFO L168 Benchmark]: Witness Printer took 246.70 ms. Allocated memory is still 1.5 GB. Free memory was 945.8 MB in the beginning and 917.8 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,912 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2084.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.1 MB in the end (delta: 229.5 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9595.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 910.1 MB in the beginning and 945.8 MB in the end (delta: -35.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 11.5 GB. * Witness Printer took 246.70 ms. Allocated memory is still 1.5 GB. Free memory was 945.8 MB in the beginning and 917.8 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((a28 == 10 && !(a25 == 1)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a28 == 7) && a21 == 1) && a25 <= 0)) || ((a28 == 9 && a19 == 1) && a17 == 8)) || ((((!(a25 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || (((a19 <= 0 && !(a25 == 1)) && a17 == 8) && !(a28 == 9))) || ((a28 == 11 && a19 == 1) && a25 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && a17 <= 7) && a19 <= 0) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a25 == 1) && !(a28 == 9))) || ((a28 == 10 && !(a25 == 1)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || ((a28 == 10 && !(a25 == 1)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || (((a17 == 8 && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((a28 == 9 && a19 == 1) && a17 == 8)) || ((((!(a25 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11)) && ((((!(5 == input) && a17 == 8) && a28 == 7) && a21 == 1) || a11 == 1))) || (((a19 <= 0 && !(a25 == 1)) && a17 == 8) && !(a28 == 9))) || ((a28 == 11 && a19 == 1) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 568 SDtfs, 1251 SDslu, 139 SDs, 0 SdLazy, 4146 SolverSat, 731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 535 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred 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, 10 MinimizatonAttempts, 825 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 352 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 777 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1982 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1842/1903 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...