./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/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.25-f470102 [2019-12-07 20:30:54,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:30:54,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:30:54,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:30:54,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:30:54,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:30:54,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:30:54,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:30:54,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:30:54,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:30:54,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:30:54,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:30:54,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:30:54,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:30:54,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:30:54,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:30:54,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:30:54,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:30:54,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:30:54,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:30:54,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:30:54,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:30:54,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:30:54,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:30:54,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:30:54,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:30:54,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:30:54,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:30:54,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:30:54,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:30:54,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:30:54,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:30:54,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:30:54,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:30:54,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:30:54,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:30:54,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:30:54,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:30:54,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:30:54,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:30:54,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:30:54,970 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:30:54,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:30:54,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:30:54,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:30:54,983 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:30:54,983 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:30:54,984 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:30:54,985 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:30:54,985 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:30:54,985 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:30:54,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:30:54,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:30:54,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:30:54,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:30:54,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:30:54,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:30:54,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:30:54,988 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_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/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-12-07 20:30:55,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:30:55,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:30:55,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:30:55,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:30:55,109 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:30:55,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-12-07 20:30:55,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/data/950c37ce1/2d9759b4523d430691eb17de620328db/FLAGed6d711fa [2019-12-07 20:30:55,611 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:30:55,612 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2019-12-07 20:30:55,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/data/950c37ce1/2d9759b4523d430691eb17de620328db/FLAGed6d711fa [2019-12-07 20:30:55,629 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/data/950c37ce1/2d9759b4523d430691eb17de620328db [2019-12-07 20:30:55,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:30:55,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:30:55,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:30:55,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:30:55,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:30:55,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:55,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55, skipping insertion in model container [2019-12-07 20:30:55,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:55,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:30:55,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:30:55,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:30:55,922 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:30:55,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:30:55,986 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:30:55,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55 WrapperNode [2019-12-07 20:30:55,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:30:55,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:30:55,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:30:55,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:30:55,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:30:56,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:30:56,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:30:56,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:30:56,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... [2019-12-07 20:30:56,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:30:56,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:30:56,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:30:56,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:30:56,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:30:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:30:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:30:57,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:30:57,234 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 20:30:57,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:30:57 BoogieIcfgContainer [2019-12-07 20:30:57,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:30:57,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:30:57,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:30:57,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:30:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:30:55" (1/3) ... [2019-12-07 20:30:57,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e85e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:30:57, skipping insertion in model container [2019-12-07 20:30:57,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:30:55" (2/3) ... [2019-12-07 20:30:57,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e85e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:30:57, skipping insertion in model container [2019-12-07 20:30:57,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:30:57" (3/3) ... [2019-12-07 20:30:57,240 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2019-12-07 20:30:57,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:30:57,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:30:57,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:30:57,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:30:57,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:30:57,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:30:57,276 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:30:57,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:30:57,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:30:57,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:30:57,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:30:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 20:30:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 20:30:57,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:57,304 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-12-07 20:30:57,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash 925957647, now seen corresponding path program 1 times [2019-12-07 20:30:57,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:57,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685884143] [2019-12-07 20:30:57,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:30:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:30:57,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685884143] [2019-12-07 20:30:57,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:30:57,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:30:57,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919001318] [2019-12-07 20:30:57,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:30:57,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:30:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:30:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:30:57,585 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 20:30:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:30:57,989 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 20:30:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:30:57,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 20:30:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:30:58,000 INFO L225 Difference]: With dead ends: 333 [2019-12-07 20:30:58,000 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 20:30:58,003 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-12-07 20:30:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 20:30:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 20:30:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 20:30:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-12-07 20:30:58,039 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-12-07 20:30:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:30:58,040 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-12-07 20:30:58,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:30:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-12-07 20:30:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 20:30:58,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:58,044 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-12-07 20:30:58,044 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 221758126, now seen corresponding path program 1 times [2019-12-07 20:30:58,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:58,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063116594] [2019-12-07 20:30:58,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:30:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:30:58,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063116594] [2019-12-07 20:30:58,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:30:58,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:30:58,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948922879] [2019-12-07 20:30:58,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:30:58,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:30:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:30:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:30:58,093 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-12-07 20:30:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:30:58,407 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-12-07 20:30:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:30:58,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 20:30:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:30:58,411 INFO L225 Difference]: With dead ends: 807 [2019-12-07 20:30:58,411 INFO L226 Difference]: Without dead ends: 565 [2019-12-07 20:30:58,412 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-12-07 20:30:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-12-07 20:30:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-12-07 20:30:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-12-07 20:30:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-12-07 20:30:58,432 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-12-07 20:30:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:30:58,432 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-12-07 20:30:58,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:30:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-12-07 20:30:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 20:30:58,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:58,435 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-12-07 20:30:58,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -875187101, now seen corresponding path program 1 times [2019-12-07 20:30:58,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:58,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354448918] [2019-12-07 20:30:58,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:30:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:30:58,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354448918] [2019-12-07 20:30:58,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:30:58,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:30:58,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759154943] [2019-12-07 20:30:58,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:30:58,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:30:58,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:30:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:30:58,484 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-12-07 20:30:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:30:58,892 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-12-07 20:30:58,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:30:58,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 20:30:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:30:58,897 INFO L225 Difference]: With dead ends: 1445 [2019-12-07 20:30:58,897 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 20:30:58,898 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-12-07 20:30:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 20:30:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-12-07 20:30:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 20:30:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1447 transitions. [2019-12-07 20:30:58,918 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1447 transitions. Word has length 102 [2019-12-07 20:30:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:30:58,918 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1447 transitions. [2019-12-07 20:30:58,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:30:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1447 transitions. [2019-12-07 20:30:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 20:30:58,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:58,921 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-12-07 20:30:58,921 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 11623352, now seen corresponding path program 1 times [2019-12-07 20:30:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:58,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976782896] [2019-12-07 20:30:58,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:30:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:30:58,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976782896] [2019-12-07 20:30:58,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:30:58,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:30:58,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077142306] [2019-12-07 20:30:58,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:30:58,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:30:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:30:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:30:58,954 INFO L87 Difference]: Start difference. First operand 883 states and 1447 transitions. Second operand 3 states. [2019-12-07 20:30:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:30:59,210 INFO L93 Difference]: Finished difference Result 2165 states and 3504 transitions. [2019-12-07 20:30:59,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:30:59,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 20:30:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:30:59,217 INFO L225 Difference]: With dead ends: 2165 [2019-12-07 20:30:59,218 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 20:30:59,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:30:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 20:30:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1203. [2019-12-07 20:30:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 20:30:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1719 transitions. [2019-12-07 20:30:59,249 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1719 transitions. Word has length 102 [2019-12-07 20:30:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:30:59,249 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1719 transitions. [2019-12-07 20:30:59,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:30:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1719 transitions. [2019-12-07 20:30:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 20:30:59,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:59,252 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-12-07 20:30:59,252 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2118167535, now seen corresponding path program 1 times [2019-12-07 20:30:59,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:59,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994658823] [2019-12-07 20:30:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:30:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:30:59,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994658823] [2019-12-07 20:30:59,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:30:59,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:30:59,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184834922] [2019-12-07 20:30:59,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:30:59,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:30:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:30:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:30:59,336 INFO L87 Difference]: Start difference. First operand 1203 states and 1719 transitions. Second operand 4 states. [2019-12-07 20:30:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:30:59,767 INFO L93 Difference]: Finished difference Result 2725 states and 3887 transitions. [2019-12-07 20:30:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:30:59,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 20:30:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:30:59,774 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 20:30:59,774 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 20:30:59,776 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-12-07 20:30:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 20:30:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-07 20:30:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 20:30:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1541 transitions. [2019-12-07 20:30:59,804 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1541 transitions. Word has length 107 [2019-12-07 20:30:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:30:59,805 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1541 transitions. [2019-12-07 20:30:59,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:30:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1541 transitions. [2019-12-07 20:30:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 20:30:59,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:30:59,808 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-12-07 20:30:59,809 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:30:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:30:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2102869639, now seen corresponding path program 1 times [2019-12-07 20:30:59,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:30:59,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775553652] [2019-12-07 20:30:59,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:30:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:31:00,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775553652] [2019-12-07 20:31:00,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:00,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:31:00,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565526191] [2019-12-07 20:31:00,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:31:00,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:31:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:31:00,080 INFO L87 Difference]: Start difference. First operand 1283 states and 1541 transitions. Second operand 8 states. [2019-12-07 20:31:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:00,723 INFO L93 Difference]: Finished difference Result 2828 states and 3388 transitions. [2019-12-07 20:31:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:31:00,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-12-07 20:31:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:00,729 INFO L225 Difference]: With dead ends: 2828 [2019-12-07 20:31:00,729 INFO L226 Difference]: Without dead ends: 1386 [2019-12-07 20:31:00,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:31:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-12-07 20:31:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1203. [2019-12-07 20:31:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 20:31:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1441 transitions. [2019-12-07 20:31:00,752 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1441 transitions. Word has length 148 [2019-12-07 20:31:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:00,753 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1441 transitions. [2019-12-07 20:31:00,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:31:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1441 transitions. [2019-12-07 20:31:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 20:31:00,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:00,756 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-12-07 20:31:00,756 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:31:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1933242070, now seen corresponding path program 1 times [2019-12-07 20:31:00,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:00,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874693710] [2019-12-07 20:31:00,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:31:00,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874693710] [2019-12-07 20:31:00,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:00,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:31:00,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986244865] [2019-12-07 20:31:00,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:00,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:00,861 INFO L87 Difference]: Start difference. First operand 1203 states and 1441 transitions. Second operand 4 states. [2019-12-07 20:31:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:01,152 INFO L93 Difference]: Finished difference Result 2245 states and 2690 transitions. [2019-12-07 20:31:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:01,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 20:31:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:01,157 INFO L225 Difference]: With dead ends: 2245 [2019-12-07 20:31:01,157 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 20:31:01,159 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-12-07 20:31:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 20:31:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-12-07 20:31:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 20:31:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1004 transitions. [2019-12-07 20:31:01,176 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1004 transitions. Word has length 157 [2019-12-07 20:31:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:01,176 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1004 transitions. [2019-12-07 20:31:01,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1004 transitions. [2019-12-07 20:31:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 20:31:01,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:01,179 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-12-07 20:31:01,179 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:31:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1296453692, now seen corresponding path program 1 times [2019-12-07 20:31:01,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:01,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283323283] [2019-12-07 20:31:01,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 20:31:01,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283323283] [2019-12-07 20:31:01,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:01,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:01,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294012191] [2019-12-07 20:31:01,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:31:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:31:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:01,254 INFO L87 Difference]: Start difference. First operand 883 states and 1004 transitions. Second operand 3 states. [2019-12-07 20:31:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:01,413 INFO L93 Difference]: Finished difference Result 1925 states and 2194 transitions. [2019-12-07 20:31:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:01,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-12-07 20:31:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:01,417 INFO L225 Difference]: With dead ends: 1925 [2019-12-07 20:31:01,417 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 20:31:01,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 20:31:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-12-07 20:31:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-07 20:31:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1177 transitions. [2019-12-07 20:31:01,430 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1177 transitions. Word has length 178 [2019-12-07 20:31:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:01,430 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1177 transitions. [2019-12-07 20:31:01,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:31:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1177 transitions. [2019-12-07 20:31:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-12-07 20:31:01,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:01,433 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-12-07 20:31:01,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:31:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1782733256, now seen corresponding path program 1 times [2019-12-07 20:31:01,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:01,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785218085] [2019-12-07 20:31:01,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 20:31:01,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785218085] [2019-12-07 20:31:01,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:01,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:31:01,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516876617] [2019-12-07 20:31:01,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:01,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:01,509 INFO L87 Difference]: Start difference. First operand 1043 states and 1177 transitions. Second operand 4 states. [2019-12-07 20:31:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:01,816 INFO L93 Difference]: Finished difference Result 2325 states and 2612 transitions. [2019-12-07 20:31:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-12-07 20:31:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:01,821 INFO L225 Difference]: With dead ends: 2325 [2019-12-07 20:31:01,822 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 20:31:01,823 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-12-07 20:31:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 20:31:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 883. [2019-12-07 20:31:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 20:31:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 949 transitions. [2019-12-07 20:31:01,840 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 949 transitions. Word has length 236 [2019-12-07 20:31:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:01,841 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 949 transitions. [2019-12-07 20:31:01,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 949 transitions. [2019-12-07 20:31:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-07 20:31:01,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:01,845 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-12-07 20:31:01,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:31:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash 933528899, now seen corresponding path program 1 times [2019-12-07 20:31:01,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:01,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813649820] [2019-12-07 20:31:01,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 61 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 20:31:02,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813649820] [2019-12-07 20:31:02,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768809500] [2019-12-07 20:31:02,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:02,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:31:02,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-07 20:31:02,305 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-07 20:31:02,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:31:02,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 11 [2019-12-07 20:31:02,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555460431] [2019-12-07 20:31:02,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:02,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:02,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:31:02,351 INFO L87 Difference]: Start difference. First operand 883 states and 949 transitions. Second operand 4 states. [2019-12-07 20:31:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:02,570 INFO L93 Difference]: Finished difference Result 1523 states and 1640 transitions. [2019-12-07 20:31:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:02,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-12-07 20:31:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:02,571 INFO L225 Difference]: With dead ends: 1523 [2019-12-07 20:31:02,571 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:31:02,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:31:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:31:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:31:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:31:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:31:02,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 262 [2019-12-07 20:31:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:02,574 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:31:02,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:31:02,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:31:02,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:02,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:31:03,107 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-07 20:31:03,339 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-12-07 20:31:03,341 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 20:31:03,341 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 20:31:03,341 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 20:31:03,342 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 20:31:03,343 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2019-12-07 20:31:03,344 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L242 CegarLoopResult]: 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-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 20:31:03,345 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 20:31:03,345 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L242 CegarLoopResult]: 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-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 20:31:03,346 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 20:31:03,347 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 20:31:03,348 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 20:31:03,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:31:03 BoogieIcfgContainer [2019-12-07 20:31:03,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:31:03,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:31:03,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:31:03,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:31:03,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:30:57" (3/4) ... [2019-12-07 20:31:03,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:31:03,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 20:31:03,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 20:31:03,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:31:03,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:31:03,500 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bc0e8e0a-0257-40fd-8396-d060fd9a6c0b/bin/utaipan/witness.graphml [2019-12-07 20:31:03,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:31:03,502 INFO L168 Benchmark]: Toolchain (without parser) took 7869.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -213.8 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,502 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:31:03,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,503 INFO L168 Benchmark]: Boogie Preprocessor took 40.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,503 INFO L168 Benchmark]: RCFGBuilder took 1157.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 219.9 MB). Peak memory consumption was 219.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,503 INFO L168 Benchmark]: TraceAbstraction took 6132.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 855.0 MB in the beginning and 1.2 GB in the end (delta: -318.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:31:03,503 INFO L168 Benchmark]: Witness Printer took 131.76 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:03,505 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1157.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 855.0 MB in the end (delta: 219.9 MB). Peak memory consumption was 219.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6132.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 855.0 MB in the beginning and 1.2 GB in the end (delta: -318.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 131.76 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 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: 5.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 568 SDtfs, 1251 SDslu, 139 SDs, 0 SdLazy, 4146 SolverSat, 731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 535 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s 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.1s 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.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s 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...