./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label13.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_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/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 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:51:30,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:51:30,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:51:30,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:51:30,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:51:30,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:51:30,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:51:30,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:51:30,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:51:30,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:51:30,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:51:30,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:51:30,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:51:30,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:51:30,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:51:30,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:51:30,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:51:30,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:51:30,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:51:30,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:51:30,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:51:30,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:51:30,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:51:30,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:51:30,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:51:30,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:51:30,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:51:30,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:51:30,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:51:30,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:51:30,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:51:30,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:51:30,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:51:30,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:51:30,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:51:30,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:51:30,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:51:30,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:51:30,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:51:30,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:51:30,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:51:30,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:51:30,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:51:30,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:51:30,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:51:30,726 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:51:30,726 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:51:30,727 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:51:30,727 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:51:30,727 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:51:30,727 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:51:30,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:51:30,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:51:30,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:51:30,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:51:30,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:51:30,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:51:30,731 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_4ce75725-a628-4e4b-94c1-c3bda2133a2a/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 -> 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 [2019-12-07 21:51:30,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:51:30,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:51:30,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:51:30,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:51:30,845 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:51:30,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2019-12-07 21:51:30,889 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/data/12456d533/72ee367245db4ad5a18acf37c4d3673a/FLAGa2a7322cd [2019-12-07 21:51:31,248 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:51:31,248 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2019-12-07 21:51:31,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/data/12456d533/72ee367245db4ad5a18acf37c4d3673a/FLAGa2a7322cd [2019-12-07 21:51:31,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/data/12456d533/72ee367245db4ad5a18acf37c4d3673a [2019-12-07 21:51:31,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:51:31,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:51:31,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:51:31,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:51:31,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:51:31,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374ca533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31, skipping insertion in model container [2019-12-07 21:51:31,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:51:31,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:51:31,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:51:31,541 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:51:31,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:51:31,602 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:51:31,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31 WrapperNode [2019-12-07 21:51:31,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:51:31,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:51:31,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:51:31,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:51:31,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:51:31,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:51:31,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:51:31,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:51:31,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... [2019-12-07 21:51:31,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:51:31,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:51:31,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:51:31,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:51:31,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/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 21:51:31,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:51:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:51:32,850 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:51:32,851 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:51:32,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:51:32 BoogieIcfgContainer [2019-12-07 21:51:32,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:51:32,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:51:32,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:51:32,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:51:32,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:51:31" (1/3) ... [2019-12-07 21:51:32,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf78c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:51:32, skipping insertion in model container [2019-12-07 21:51:32,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:31" (2/3) ... [2019-12-07 21:51:32,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf78c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:51:32, skipping insertion in model container [2019-12-07 21:51:32,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:51:32" (3/3) ... [2019-12-07 21:51:32,857 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2019-12-07 21:51:32,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:51:32,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:51:32,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:51:32,894 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:51:32,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:51:32,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:51:32,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:51:32,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:51:32,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:51:32,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:51:32,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:51:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 21:51:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 21:51:32,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:32,912 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] [2019-12-07 21:51:32,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1323230873, now seen corresponding path program 1 times [2019-12-07 21:51:32,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:32,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 21:51:32,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:33,184 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 21:51:33,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657880690] [2019-12-07 21:51:33,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:33,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:51:33,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263701672] [2019-12-07 21:51:33,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:33,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:33,205 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 21:51:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:33,615 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 21:51:33,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:51:33,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 21:51:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:33,627 INFO L225 Difference]: With dead ends: 297 [2019-12-07 21:51:33,628 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 21:51:33,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:51:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 21:51:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 21:51:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 21:51:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-12-07 21:51:33,672 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-12-07 21:51:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:33,672 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-12-07 21:51:33,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-12-07 21:51:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 21:51:33,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:33,677 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 21:51:33,677 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash 585786847, now seen corresponding path program 1 times [2019-12-07 21:51:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:33,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583982250] [2019-12-07 21:51:33,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:51:33,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583982250] [2019-12-07 21:51:33,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:33,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:51:33,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118561471] [2019-12-07 21:51:33,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:33,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:33,717 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-12-07 21:51:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:33,970 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-12-07 21:51:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:33,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 21:51:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:33,973 INFO L225 Difference]: With dead ends: 644 [2019-12-07 21:51:33,973 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:51:33,975 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 21:51:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:51:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 21:51:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:51:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-12-07 21:51:33,996 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-12-07 21:51:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:33,996 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-12-07 21:51:33,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-12-07 21:51:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:51:34,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:34,000 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 21:51:34,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 928594153, now seen corresponding path program 1 times [2019-12-07 21:51:34,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:34,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981891604] [2019-12-07 21:51:34,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:51:34,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981891604] [2019-12-07 21:51:34,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:34,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:34,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358893297] [2019-12-07 21:51:34,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:34,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:34,053 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-12-07 21:51:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:34,300 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-12-07 21:51:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 21:51:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:34,304 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 21:51:34,304 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 21:51:34,305 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 21:51:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 21:51:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-12-07 21:51:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 21:51:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-12-07 21:51:34,318 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-12-07 21:51:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:34,318 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-12-07 21:51:34,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-12-07 21:51:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 21:51:34,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:34,320 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 21:51:34,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1330790132, now seen corresponding path program 1 times [2019-12-07 21:51:34,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:34,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132465672] [2019-12-07 21:51:34,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 21:51:34,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132465672] [2019-12-07 21:51:34,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:34,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:34,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464711274] [2019-12-07 21:51:34,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:34,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:34,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:34,374 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-12-07 21:51:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:34,577 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-12-07 21:51:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:34,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 21:51:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:34,582 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 21:51:34,582 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 21:51:34,583 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 21:51:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 21:51:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-12-07 21:51:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 21:51:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 985 transitions. [2019-12-07 21:51:34,601 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 985 transitions. Word has length 133 [2019-12-07 21:51:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:34,602 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 985 transitions. [2019-12-07 21:51:34,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 985 transitions. [2019-12-07 21:51:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 21:51:34,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:34,604 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 21:51:34,605 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -573607776, now seen corresponding path program 1 times [2019-12-07 21:51:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:34,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011920251] [2019-12-07 21:51:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:51:34,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011920251] [2019-12-07 21:51:34,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:34,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:51:34,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119285449] [2019-12-07 21:51:34,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:34,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:34,678 INFO L87 Difference]: Start difference. First operand 642 states and 985 transitions. Second operand 4 states. [2019-12-07 21:51:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:34,976 INFO L93 Difference]: Finished difference Result 1371 states and 2075 transitions. [2019-12-07 21:51:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:51:34,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 21:51:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:34,980 INFO L225 Difference]: With dead ends: 1371 [2019-12-07 21:51:34,980 INFO L226 Difference]: Without dead ends: 730 [2019-12-07 21:51:34,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:51:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-07 21:51:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 713. [2019-12-07 21:51:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 21:51:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1062 transitions. [2019-12-07 21:51:35,000 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1062 transitions. Word has length 141 [2019-12-07 21:51:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:35,000 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1062 transitions. [2019-12-07 21:51:35,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1062 transitions. [2019-12-07 21:51:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 21:51:35,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:35,003 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 21:51:35,003 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 925215960, now seen corresponding path program 1 times [2019-12-07 21:51:35,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:35,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281880568] [2019-12-07 21:51:35,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 21:51:35,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281880568] [2019-12-07 21:51:35,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:35,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:51:35,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339071581] [2019-12-07 21:51:35,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:35,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:35,064 INFO L87 Difference]: Start difference. First operand 713 states and 1062 transitions. Second operand 4 states. [2019-12-07 21:51:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:35,437 INFO L93 Difference]: Finished difference Result 1638 states and 2462 transitions. [2019-12-07 21:51:35,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:51:35,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 21:51:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:35,441 INFO L225 Difference]: With dead ends: 1638 [2019-12-07 21:51:35,441 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 21:51:35,442 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 21:51:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 21:51:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 855. [2019-12-07 21:51:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 21:51:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1222 transitions. [2019-12-07 21:51:35,458 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1222 transitions. Word has length 145 [2019-12-07 21:51:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:35,458 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1222 transitions. [2019-12-07 21:51:35,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1222 transitions. [2019-12-07 21:51:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 21:51:35,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:35,461 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:35,461 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1683940325, now seen corresponding path program 1 times [2019-12-07 21:51:35,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:35,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109091739] [2019-12-07 21:51:35,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:51:35,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109091739] [2019-12-07 21:51:35,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:35,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:51:35,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484893288] [2019-12-07 21:51:35,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:51:35,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:51:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:51:35,586 INFO L87 Difference]: Start difference. First operand 855 states and 1222 transitions. Second operand 8 states. [2019-12-07 21:51:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:36,064 INFO L93 Difference]: Finished difference Result 1887 states and 2705 transitions. [2019-12-07 21:51:36,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:51:36,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-12-07 21:51:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:36,069 INFO L225 Difference]: With dead ends: 1887 [2019-12-07 21:51:36,069 INFO L226 Difference]: Without dead ends: 1104 [2019-12-07 21:51:36,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:51:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-07 21:51:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-12-07 21:51:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 21:51:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1400 transitions. [2019-12-07 21:51:36,086 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1400 transitions. Word has length 159 [2019-12-07 21:51:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:36,086 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1400 transitions. [2019-12-07 21:51:36,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:51:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1400 transitions. [2019-12-07 21:51:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 21:51:36,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:36,089 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:36,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:51:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 311593622, now seen corresponding path program 1 times [2019-12-07 21:51:36,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:36,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540857760] [2019-12-07 21:51:36,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:51:36,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540857760] [2019-12-07 21:51:36,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:36,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:51:36,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627170708] [2019-12-07 21:51:36,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:36,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:36,143 INFO L87 Difference]: Start difference. First operand 997 states and 1400 transitions. Second operand 4 states. [2019-12-07 21:51:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:36,446 INFO L93 Difference]: Finished difference Result 2417 states and 3386 transitions. [2019-12-07 21:51:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:51:36,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 21:51:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:36,447 INFO L225 Difference]: With dead ends: 2417 [2019-12-07 21:51:36,447 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:51:36,448 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 21:51:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:51:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:51:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:51:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:51:36,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-12-07 21:51:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:36,449 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:51:36,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:51:36,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:51:36,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:51:36,587 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 21:51:36,588 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (= 13 ~a8~0))) [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 21:51:36,589 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-12-07 21:51:36,590 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 21:51:36,591 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (= 13 ~a8~0))) [2019-12-07 21:51:36,591 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 21:51:36,592 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2019-12-07 21:51:36,593 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 21:51:36,594 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 21:51:36,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:51:36 BoogieIcfgContainer [2019-12-07 21:51:36,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:51:36,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:51:36,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:51:36,611 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:51:36,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:51:32" (3/4) ... [2019-12-07 21:51:36,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:51:36,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 21:51:36,634 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 21:51:36,635 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 21:51:36,637 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:51:36,767 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ce75725-a628-4e4b-94c1-c3bda2133a2a/bin/utaipan/witness.graphml [2019-12-07 21:51:36,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:51:36,768 INFO L168 Benchmark]: Toolchain (without parser) took 5499.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:51:36,768 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:51:36,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:51:36,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.15 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 21:51:36,769 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 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 21:51:36,769 INFO L168 Benchmark]: RCFGBuilder took 1162.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.8 MB in the end (delta: 207.2 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:51:36,770 INFO L168 Benchmark]: TraceAbstraction took 3757.52 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 858.8 MB in the beginning and 1.1 GB in the end (delta: -284.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:51:36,770 INFO L168 Benchmark]: Witness Printer took 156.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:51:36,771 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -139.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.15 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 36.31 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 1162.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.8 MB in the end (delta: 207.2 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3757.52 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 858.8 MB in the beginning and 1.1 GB in the end (delta: -284.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 156.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: 30]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || 13 == a8 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || 13 == a8 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 420 SDtfs, 1067 SDslu, 76 SDs, 0 SdLazy, 2808 SolverSat, 776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 479 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 39 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8949 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 976 ConstructedInterpolants, 0 QuantifiedInterpolants, 276883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 875/875 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...