./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label23.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/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 a07d46acee19a1bf676413a71857b7cd94a5f704 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:34,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:34,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:35,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:35,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:35,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:35,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:35,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:35,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:35,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:35,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:35,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:35,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:35,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:35,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:35,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:35,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:35,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:35,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:35,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:35,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:35,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:35,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:35,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:35,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:35,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:35,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:35,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:35,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:35,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:35,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:35,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:35,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:35,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:35,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:35,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:35,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:35,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:35,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:35,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:35,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:35,051 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:35,062 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:35,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:35,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:35,063 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:35,063 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:35,063 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:35,064 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:35,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:35,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:35,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:35,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:35,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:35,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:35,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:35,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:35,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:35,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:35,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:35,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:35,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:35,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:35,068 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:35,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:35,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:35,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:35,069 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/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/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 -> a07d46acee19a1bf676413a71857b7cd94a5f704 [2019-10-22 11:21:35,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:35,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:35,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:35,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:35,123 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:35,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label23.c [2019-10-22 11:21:35,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/data/0cd39b010/2965482b912f466ab32851314cc63a5a/FLAGc053ca2ab [2019-10-22 11:21:35,639 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:35,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/sv-benchmarks/c/eca-rers2012/Problem02_label23.c [2019-10-22 11:21:35,649 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/data/0cd39b010/2965482b912f466ab32851314cc63a5a/FLAGc053ca2ab [2019-10-22 11:21:35,987 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/data/0cd39b010/2965482b912f466ab32851314cc63a5a [2019-10-22 11:21:35,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:35,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:35,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:35,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:35,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:35,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:35,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201d2f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:35, skipping insertion in model container [2019-10-22 11:21:35,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:35" (1/1) ... [2019-10-22 11:21:36,007 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:36,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:36,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:36,433 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:36,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:36,550 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:36,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36 WrapperNode [2019-10-22 11:21:36,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:36,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:36,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:36,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:36,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:36,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:36,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:36,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:36,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... [2019-10-22 11:21:36,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:36,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:36,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:36,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:36,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/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-10-22 11:21:36,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:36,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:37,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:37,697 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:37,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:37 BoogieIcfgContainer [2019-10-22 11:21:37,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:37,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:37,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:37,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:37,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:35" (1/3) ... [2019-10-22 11:21:37,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f8e756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:37, skipping insertion in model container [2019-10-22 11:21:37,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:36" (2/3) ... [2019-10-22 11:21:37,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f8e756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:37, skipping insertion in model container [2019-10-22 11:21:37,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:37" (3/3) ... [2019-10-22 11:21:37,706 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label23.c [2019-10-22 11:21:37,717 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:37,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:37,736 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:37,767 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:37,768 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:37,768 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:37,768 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:37,768 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:37,768 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:37,768 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:37,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-10-22 11:21:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-22 11:21:37,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:37,808 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:37,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash 724191355, now seen corresponding path program 1 times [2019-10-22 11:21:37,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:37,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100279088] [2019-10-22 11:21:37,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:37,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:38,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100279088] [2019-10-22 11:21:38,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:38,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:38,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986540464] [2019-10-22 11:21:38,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:38,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:38,279 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-10-22 11:21:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:39,520 INFO L93 Difference]: Finished difference Result 746 states and 1322 transitions. [2019-10-22 11:21:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:39,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-22 11:21:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:39,536 INFO L225 Difference]: With dead ends: 746 [2019-10-22 11:21:39,536 INFO L226 Difference]: Without dead ends: 452 [2019-10-22 11:21:39,540 INFO L600 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-10-22 11:21:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-22 11:21:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2019-10-22 11:21:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-22 11:21:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 609 transitions. [2019-10-22 11:21:39,619 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 609 transitions. Word has length 133 [2019-10-22 11:21:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:39,621 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 609 transitions. [2019-10-22 11:21:39,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 609 transitions. [2019-10-22 11:21:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-22 11:21:39,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:39,634 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:39,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1972136261, now seen corresponding path program 1 times [2019-10-22 11:21:39,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:39,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686818628] [2019-10-22 11:21:39,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:39,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686818628] [2019-10-22 11:21:39,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:39,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:39,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558212705] [2019-10-22 11:21:39,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:39,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:39,739 INFO L87 Difference]: Start difference. First operand 449 states and 609 transitions. Second operand 3 states. [2019-10-22 11:21:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,207 INFO L93 Difference]: Finished difference Result 1040 states and 1422 transitions. [2019-10-22 11:21:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:40,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-22 11:21:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,210 INFO L225 Difference]: With dead ends: 1040 [2019-10-22 11:21:40,210 INFO L226 Difference]: Without dead ends: 593 [2019-10-22 11:21:40,212 INFO L600 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-10-22 11:21:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-22 11:21:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 592. [2019-10-22 11:21:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-22 11:21:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 767 transitions. [2019-10-22 11:21:40,247 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 767 transitions. Word has length 142 [2019-10-22 11:21:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,247 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 767 transitions. [2019-10-22 11:21:40,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 767 transitions. [2019-10-22 11:21:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-22 11:21:40,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:40,250 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:40,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2022034289, now seen corresponding path program 1 times [2019-10-22 11:21:40,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:40,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193480119] [2019-10-22 11:21:40,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:40,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193480119] [2019-10-22 11:21:40,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:40,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:40,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631631940] [2019-10-22 11:21:40,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:40,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:40,340 INFO L87 Difference]: Start difference. First operand 592 states and 767 transitions. Second operand 3 states. [2019-10-22 11:21:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:40,789 INFO L93 Difference]: Finished difference Result 1324 states and 1736 transitions. [2019-10-22 11:21:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:40,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-22 11:21:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:40,792 INFO L225 Difference]: With dead ends: 1324 [2019-10-22 11:21:40,792 INFO L226 Difference]: Without dead ends: 734 [2019-10-22 11:21:40,793 INFO L600 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-10-22 11:21:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-22 11:21:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 733. [2019-10-22 11:21:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-22 11:21:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 918 transitions. [2019-10-22 11:21:40,810 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 918 transitions. Word has length 146 [2019-10-22 11:21:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:40,810 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 918 transitions. [2019-10-22 11:21:40,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 918 transitions. [2019-10-22 11:21:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 11:21:40,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:40,812 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:40,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash 896663584, now seen corresponding path program 1 times [2019-10-22 11:21:40,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:40,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255397494] [2019-10-22 11:21:40,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:40,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:21:40,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255397494] [2019-10-22 11:21:40,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:40,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:40,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499346736] [2019-10-22 11:21:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:40,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:40,888 INFO L87 Difference]: Start difference. First operand 733 states and 918 transitions. Second operand 3 states. [2019-10-22 11:21:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:41,316 INFO L93 Difference]: Finished difference Result 2025 states and 2561 transitions. [2019-10-22 11:21:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:41,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 11:21:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:41,321 INFO L225 Difference]: With dead ends: 2025 [2019-10-22 11:21:41,321 INFO L226 Difference]: Without dead ends: 1294 [2019-10-22 11:21:41,322 INFO L600 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-10-22 11:21:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-10-22 11:21:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2019-10-22 11:21:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-10-22 11:21:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1584 transitions. [2019-10-22 11:21:41,351 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1584 transitions. Word has length 154 [2019-10-22 11:21:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:41,352 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 1584 transitions. [2019-10-22 11:21:41,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1584 transitions. [2019-10-22 11:21:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 11:21:41,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:41,355 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:41,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1264073784, now seen corresponding path program 1 times [2019-10-22 11:21:41,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:41,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394527053] [2019-10-22 11:21:41,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:41,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394527053] [2019-10-22 11:21:41,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:41,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:41,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010156408] [2019-10-22 11:21:41,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:41,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:41,815 INFO L87 Difference]: Start difference. First operand 1294 states and 1584 transitions. Second operand 10 states. [2019-10-22 11:21:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:42,798 INFO L93 Difference]: Finished difference Result 3512 states and 4258 transitions. [2019-10-22 11:21:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:21:42,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2019-10-22 11:21:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:42,807 INFO L225 Difference]: With dead ends: 3512 [2019-10-22 11:21:42,807 INFO L226 Difference]: Without dead ends: 2220 [2019-10-22 11:21:42,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-10-22 11:21:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1653. [2019-10-22 11:21:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-10-22 11:21:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1966 transitions. [2019-10-22 11:21:42,847 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1966 transitions. Word has length 163 [2019-10-22 11:21:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:42,848 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 1966 transitions. [2019-10-22 11:21:42,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1966 transitions. [2019-10-22 11:21:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-22 11:21:42,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:42,854 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:42,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash 356210694, now seen corresponding path program 1 times [2019-10-22 11:21:42,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:42,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053507352] [2019-10-22 11:21:42,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-22 11:21:42,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053507352] [2019-10-22 11:21:42,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:42,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:42,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153339348] [2019-10-22 11:21:42,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:42,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:42,968 INFO L87 Difference]: Start difference. First operand 1653 states and 1966 transitions. Second operand 4 states. [2019-10-22 11:21:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:43,642 INFO L93 Difference]: Finished difference Result 4007 states and 4789 transitions. [2019-10-22 11:21:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:43,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-10-22 11:21:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:43,648 INFO L225 Difference]: With dead ends: 4007 [2019-10-22 11:21:43,648 INFO L226 Difference]: Without dead ends: 1924 [2019-10-22 11:21:43,654 INFO L600 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-10-22 11:21:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-10-22 11:21:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1922. [2019-10-22 11:21:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-10-22 11:21:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2124 transitions. [2019-10-22 11:21:43,688 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2124 transitions. Word has length 208 [2019-10-22 11:21:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:43,688 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 2124 transitions. [2019-10-22 11:21:43,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2124 transitions. [2019-10-22 11:21:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-22 11:21:43,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:43,697 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:43,698 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1628034055, now seen corresponding path program 1 times [2019-10-22 11:21:43,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:43,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105778234] [2019-10-22 11:21:43,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:21:43,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105778234] [2019-10-22 11:21:43,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:43,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:43,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406619142] [2019-10-22 11:21:43,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:43,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:43,775 INFO L87 Difference]: Start difference. First operand 1922 states and 2124 transitions. Second operand 3 states. [2019-10-22 11:21:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:44,131 INFO L93 Difference]: Finished difference Result 4821 states and 5380 transitions. [2019-10-22 11:21:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:44,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-22 11:21:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:44,137 INFO L225 Difference]: With dead ends: 4821 [2019-10-22 11:21:44,137 INFO L226 Difference]: Without dead ends: 2198 [2019-10-22 11:21:44,139 INFO L600 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-10-22 11:21:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-10-22 11:21:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1918. [2019-10-22 11:21:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-10-22 11:21:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2092 transitions. [2019-10-22 11:21:44,169 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2092 transitions. Word has length 209 [2019-10-22 11:21:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:44,170 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 2092 transitions. [2019-10-22 11:21:44,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2092 transitions. [2019-10-22 11:21:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-22 11:21:44,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:44,176 INFO L380 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:44,176 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1477634784, now seen corresponding path program 1 times [2019-10-22 11:21:44,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:44,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003680807] [2019-10-22 11:21:44,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-22 11:21:44,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003680807] [2019-10-22 11:21:44,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:44,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:44,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056440508] [2019-10-22 11:21:44,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:44,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:44,320 INFO L87 Difference]: Start difference. First operand 1918 states and 2092 transitions. Second operand 3 states. [2019-10-22 11:21:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:44,657 INFO L93 Difference]: Finished difference Result 3832 states and 4180 transitions. [2019-10-22 11:21:44,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:44,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-10-22 11:21:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:44,662 INFO L225 Difference]: With dead ends: 3832 [2019-10-22 11:21:44,662 INFO L226 Difference]: Without dead ends: 1916 [2019-10-22 11:21:44,664 INFO L600 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-10-22 11:21:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2019-10-22 11:21:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1775. [2019-10-22 11:21:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-10-22 11:21:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1906 transitions. [2019-10-22 11:21:44,694 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1906 transitions. Word has length 276 [2019-10-22 11:21:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:44,695 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 1906 transitions. [2019-10-22 11:21:44,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1906 transitions. [2019-10-22 11:21:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-22 11:21:44,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:44,700 INFO L380 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:44,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1652705939, now seen corresponding path program 1 times [2019-10-22 11:21:44,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:44,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637136804] [2019-10-22 11:21:44,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 11:21:44,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637136804] [2019-10-22 11:21:44,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:44,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:44,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521600816] [2019-10-22 11:21:44,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:44,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:44,792 INFO L87 Difference]: Start difference. First operand 1775 states and 1906 transitions. Second operand 4 states. [2019-10-22 11:21:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,293 INFO L93 Difference]: Finished difference Result 3407 states and 3660 transitions. [2019-10-22 11:21:45,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:45,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-10-22 11:21:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,298 INFO L225 Difference]: With dead ends: 3407 [2019-10-22 11:21:45,298 INFO L226 Difference]: Without dead ends: 1634 [2019-10-22 11:21:45,300 INFO L600 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-10-22 11:21:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-10-22 11:21:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1633. [2019-10-22 11:21:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1633 states. [2019-10-22 11:21:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1723 transitions. [2019-10-22 11:21:45,325 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1723 transitions. Word has length 278 [2019-10-22 11:21:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:45,329 INFO L462 AbstractCegarLoop]: Abstraction has 1633 states and 1723 transitions. [2019-10-22 11:21:45,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1723 transitions. [2019-10-22 11:21:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-22 11:21:45,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:45,335 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:45,335 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1187267132, now seen corresponding path program 1 times [2019-10-22 11:21:45,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:45,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642917095] [2019-10-22 11:21:45,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-22 11:21:45,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642917095] [2019-10-22 11:21:45,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:45,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:45,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559640238] [2019-10-22 11:21:45,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:45,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:45,550 INFO L87 Difference]: Start difference. First operand 1633 states and 1723 transitions. Second operand 3 states. [2019-10-22 11:21:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,835 INFO L93 Difference]: Finished difference Result 3543 states and 3741 transitions. [2019-10-22 11:21:45,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:45,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-22 11:21:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,840 INFO L225 Difference]: With dead ends: 3543 [2019-10-22 11:21:45,840 INFO L226 Difference]: Without dead ends: 1770 [2019-10-22 11:21:45,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2019-10-22 11:21:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1769. [2019-10-22 11:21:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-10-22 11:21:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 1861 transitions. [2019-10-22 11:21:45,866 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 1861 transitions. Word has length 284 [2019-10-22 11:21:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:45,866 INFO L462 AbstractCegarLoop]: Abstraction has 1769 states and 1861 transitions. [2019-10-22 11:21:45,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 1861 transitions. [2019-10-22 11:21:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-22 11:21:45,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:45,871 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:21:45,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash -980830224, now seen corresponding path program 1 times [2019-10-22 11:21:45,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:45,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063118055] [2019-10-22 11:21:45,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-22 11:21:45,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063118055] [2019-10-22 11:21:45,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:45,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:45,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041469529] [2019-10-22 11:21:45,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:45,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:45,975 INFO L87 Difference]: Start difference. First operand 1769 states and 1861 transitions. Second operand 4 states. [2019-10-22 11:21:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,316 INFO L93 Difference]: Finished difference Result 3392 states and 3574 transitions. [2019-10-22 11:21:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:46,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-10-22 11:21:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,317 INFO L225 Difference]: With dead ends: 3392 [2019-10-22 11:21:46,317 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:46,319 INFO L600 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-10-22 11:21:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:46,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2019-10-22 11:21:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,320 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:46,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:46,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:46,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:46,516 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-22 11:21:46,646 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-22 11:21:46,648 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,648 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-22 11:21:46,649 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,650 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,651 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,652 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,652 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-22 11:21:46,652 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-22 11:21:46,652 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-22 11:21:46,652 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,654 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,655 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-22 11:21:46,656 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-22 11:21:46,657 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-22 11:21:46,661 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-22 11:21:46,662 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:21:46,663 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse4 (= ~a28~0 9)) (.cse6 (= 10 ~a28~0)) (.cse1 (= ~a19~0 1)) (.cse7 (= ~a11~0 1)) (.cse2 (not (= ~a28~0 11))) (.cse8 (not (= 1 ~a11~0))) (.cse5 (<= ~a19~0 0)) (.cse9 (not .cse3)) (.cse0 (= ~a17~0 8))) (or (and .cse0 .cse1 (= ~a21~0 1) .cse2) (and (<= 11 ~a28~0) .cse1 .cse3) (and .cse4 .cse5) (and .cse1 .cse6) (and (= ~a28~0 7) .cse7) (and .cse8 .cse1 .cse0 (not .cse4) .cse2) (and .cse9 .cse6 .cse7) (and (<= 10 ~a28~0) .cse1 .cse7) (and .cse8 .cse5 .cse0 .cse2) (and .cse8 .cse5 .cse9 .cse0)))) [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-22 11:21:46,664 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 571) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,665 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:21:46,666 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:21:46,666 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-22 11:21:46,666 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-22 11:21:46,666 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-22 11:21:46,666 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse4 (= ~a28~0 9)) (.cse6 (= 10 ~a28~0)) (.cse1 (= ~a19~0 1)) (.cse7 (= ~a11~0 1)) (.cse2 (not (= ~a28~0 11))) (.cse8 (not (= 1 ~a11~0))) (.cse5 (<= ~a19~0 0)) (.cse9 (not .cse3)) (.cse0 (= ~a17~0 8))) (or (and .cse0 .cse1 (= ~a21~0 1) .cse2) (and (<= 11 ~a28~0) .cse1 .cse3) (and .cse4 .cse5) (and .cse1 .cse6) (and (= ~a28~0 7) .cse7) (and .cse8 .cse1 .cse0 (not .cse4) .cse2) (and .cse9 .cse6 .cse7) (and (<= 10 ~a28~0) .cse1 .cse7) (and .cse8 .cse5 .cse0 .cse2) (and .cse8 .cse5 .cse9 .cse0)))) [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-22 11:21:46,667 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,668 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,669 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-22 11:21:46,670 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:21:46,671 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-22 11:21:46,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:46 BoogieIcfgContainer [2019-10-22 11:21:46,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:46,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:46,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:46,699 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:46,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:37" (3/4) ... [2019-10-22 11:21:46,702 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:46,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:21:46,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:46,863 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4744ae3-56c3-4c81-8ce5-3ebab5537b55/bin/utaipan/witness.graphml [2019-10-22 11:21:46,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:46,864 INFO L168 Benchmark]: Toolchain (without parser) took 10874.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.7 MB). Free memory was 937.8 MB in the beginning and 934.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 428.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,864 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:46,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,865 INFO L168 Benchmark]: Boogie Preprocessor took 64.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,865 INFO L168 Benchmark]: RCFGBuilder took 1006.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,866 INFO L168 Benchmark]: TraceAbstraction took 8999.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 995.8 MB in the beginning and 949.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,866 INFO L168 Benchmark]: Witness Printer took 164.60 ms. Allocated memory is still 1.5 GB. Free memory was 949.5 MB in the beginning and 934.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:46,867 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1006.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.8 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8999.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 280.5 MB). Free memory was 995.8 MB in the beginning and 949.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. * Witness Printer took 164.60 ms. Allocated memory is still 1.5 GB. Free memory was 949.5 MB in the beginning and 934.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 571]: 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: (((((((((((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (a19 == 1 && 10 == a28)) || (a28 == 7 && a11 == 1)) || ((((!(1 == a11) && a19 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || ((!(a25 == 1) && 10 == a28) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || (((!(1 == a11) && a19 <= 0) && a17 == 8) && !(a28 == 11))) || (((!(1 == a11) && a19 <= 0) && !(a25 == 1)) && a17 == 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (a19 == 1 && 10 == a28)) || (a28 == 7 && a11 == 1)) || ((((!(1 == a11) && a19 == 1) && a17 == 8) && !(a28 == 9)) && !(a28 == 11))) || ((!(a25 == 1) && 10 == a28) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || (((!(1 == a11) && a19 <= 0) && a17 == 8) && !(a28 == 11))) || (((!(1 == a11) && a19 <= 0) && !(a25 == 1)) && a17 == 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 1249 SDtfs, 2537 SDslu, 241 SDs, 0 SdLazy, 5542 SolverSat, 973 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 997 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 233 HoareAnnotationTreeSize, 3 FomulaSimplifications, 828 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 214 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2284 NumberOfCodeBlocks, 2284 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1136486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1382/1382 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...