./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label54.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/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label54.c -s /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7013b5440d15c52781747fe18e114861ef321ee3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:14:10,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:10,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:10,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:10,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:10,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:10,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:10,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:10,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:10,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:10,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:10,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:10,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:10,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:10,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:10,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:10,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:10,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:10,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:10,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:10,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:10,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:10,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:10,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:10,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:10,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:10,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:10,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:10,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:10,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:10,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:10,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:10,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:10,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:10,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:10,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:10,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:10,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:10,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:10,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:10,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:10,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:14:10,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:10,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:10,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:10,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:10,785 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:10,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:10,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:14:10,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:10,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:14:10,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:10,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:14:10,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:14:10,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:14:10,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:14:10,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:14:10,789 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:10,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:14:10,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:10,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:10,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:14:10,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:14:10,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:10,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:10,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:14:10,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:14:10,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:10,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:14:10,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:14:10,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer 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 -> Automizer 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 -> 7013b5440d15c52781747fe18e114861ef321ee3 [2019-11-15 21:14:10,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:10,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:10,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:10,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:10,842 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:10,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2019-11-15 21:14:10,892 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/data/756277f74/aa95c193c7534aefb2cf044145238542/FLAGd12e1cf84 [2019-11-15 21:14:11,462 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:11,463 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2019-11-15 21:14:11,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/data/756277f74/aa95c193c7534aefb2cf044145238542/FLAGd12e1cf84 [2019-11-15 21:14:11,911 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/data/756277f74/aa95c193c7534aefb2cf044145238542 [2019-11-15 21:14:11,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:11,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:14:11,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:11,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:11,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:11,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:11" (1/1) ... [2019-11-15 21:14:11,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ff138a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:11, skipping insertion in model container [2019-11-15 21:14:11,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:11" (1/1) ... [2019-11-15 21:14:11,929 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:11,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:12,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:12,389 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:12,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:12,494 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:12,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12 WrapperNode [2019-11-15 21:14:12,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:12,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:12,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:14:12,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:14:12,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:12,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:12,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:12,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:12,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... [2019-11-15 21:14:12,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:12,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:12,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:12,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:12,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:13,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:13,789 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:14:13,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:13 BoogieIcfgContainer [2019-11-15 21:14:13,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:13,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:14:13,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:14:13,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:14:13,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:14:11" (1/3) ... [2019-11-15 21:14:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14df72bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:13, skipping insertion in model container [2019-11-15 21:14:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:12" (2/3) ... [2019-11-15 21:14:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14df72bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:13, skipping insertion in model container [2019-11-15 21:14:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:13" (3/3) ... [2019-11-15 21:14:13,802 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label54.c [2019-11-15 21:14:13,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:14:13,821 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:14:13,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:14:13,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:14:13,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:14:13,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:14:13,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:13,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:13,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:14:13,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:13,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:14:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 21:14:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:14:13,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:13,898 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] [2019-11-15 21:14:13,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1695579141, now seen corresponding path program 1 times [2019-11-15 21:14:13,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:13,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254971813] [2019-11-15 21:14:13,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:13,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:13,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:14,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254971813] [2019-11-15 21:14:14,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:14,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:14:14,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817014020] [2019-11-15 21:14:14,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:14,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:14,343 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2019-11-15 21:14:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:15,365 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2019-11-15 21:14:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:15,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-15 21:14:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:15,379 INFO L225 Difference]: With dead ends: 601 [2019-11-15 21:14:15,379 INFO L226 Difference]: Without dead ends: 310 [2019-11-15 21:14:15,383 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-11-15 21:14:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-15 21:14:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-11-15 21:14:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-15 21:14:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2019-11-15 21:14:15,436 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 101 [2019-11-15 21:14:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:15,438 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2019-11-15 21:14:15,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2019-11-15 21:14:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 21:14:15,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:15,443 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:15,444 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash -292589926, now seen corresponding path program 1 times [2019-11-15 21:14:15,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:15,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053516244] [2019-11-15 21:14:15,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:15,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:15,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:15,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053516244] [2019-11-15 21:14:15,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:15,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:15,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463240666] [2019-11-15 21:14:15,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:15,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:15,570 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand 4 states. [2019-11-15 21:14:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:16,427 INFO L93 Difference]: Finished difference Result 1200 states and 1733 transitions. [2019-11-15 21:14:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:16,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-15 21:14:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:16,436 INFO L225 Difference]: With dead ends: 1200 [2019-11-15 21:14:16,436 INFO L226 Difference]: Without dead ends: 892 [2019-11-15 21:14:16,438 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-11-15 21:14:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-11-15 21:14:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 593. [2019-11-15 21:14:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-15 21:14:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 827 transitions. [2019-11-15 21:14:16,484 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 827 transitions. Word has length 119 [2019-11-15 21:14:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:16,484 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 827 transitions. [2019-11-15 21:14:16,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 827 transitions. [2019-11-15 21:14:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 21:14:16,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:16,489 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:14:16,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 566132794, now seen corresponding path program 1 times [2019-11-15 21:14:16,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:16,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184516022] [2019-11-15 21:14:16,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:16,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:16,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:16,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184516022] [2019-11-15 21:14:16,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:16,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:16,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697392371] [2019-11-15 21:14:16,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:16,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:16,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:16,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:16,607 INFO L87 Difference]: Start difference. First operand 593 states and 827 transitions. Second operand 4 states. [2019-11-15 21:14:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:17,571 INFO L93 Difference]: Finished difference Result 2316 states and 3244 transitions. [2019-11-15 21:14:17,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:17,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 21:14:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:17,581 INFO L225 Difference]: With dead ends: 2316 [2019-11-15 21:14:17,581 INFO L226 Difference]: Without dead ends: 1725 [2019-11-15 21:14:17,583 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-11-15 21:14:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-11-15 21:14:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1151. [2019-11-15 21:14:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-15 21:14:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1548 transitions. [2019-11-15 21:14:17,638 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1548 transitions. Word has length 120 [2019-11-15 21:14:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:17,640 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1548 transitions. [2019-11-15 21:14:17,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1548 transitions. [2019-11-15 21:14:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 21:14:17,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:17,648 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:17,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash -157142321, now seen corresponding path program 1 times [2019-11-15 21:14:17,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:17,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971930972] [2019-11-15 21:14:17,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:17,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:17,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:17,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971930972] [2019-11-15 21:14:17,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:17,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:17,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116718291] [2019-11-15 21:14:17,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:17,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:17,798 INFO L87 Difference]: Start difference. First operand 1151 states and 1548 transitions. Second operand 4 states. [2019-11-15 21:14:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:18,872 INFO L93 Difference]: Finished difference Result 3563 states and 4698 transitions. [2019-11-15 21:14:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-15 21:14:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:18,888 INFO L225 Difference]: With dead ends: 3563 [2019-11-15 21:14:18,888 INFO L226 Difference]: Without dead ends: 2414 [2019-11-15 21:14:18,890 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-11-15 21:14:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-15 21:14:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2131. [2019-11-15 21:14:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-15 21:14:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2618 transitions. [2019-11-15 21:14:18,944 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2618 transitions. Word has length 123 [2019-11-15 21:14:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:18,945 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2618 transitions. [2019-11-15 21:14:18,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2618 transitions. [2019-11-15 21:14:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-15 21:14:18,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:18,949 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:18,949 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash -920596231, now seen corresponding path program 1 times [2019-11-15 21:14:18,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:18,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195362170] [2019-11-15 21:14:18,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:18,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:18,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:14:19,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195362170] [2019-11-15 21:14:19,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:19,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:19,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222150703] [2019-11-15 21:14:19,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:19,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:19,071 INFO L87 Difference]: Start difference. First operand 2131 states and 2618 transitions. Second operand 4 states. [2019-11-15 21:14:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:19,916 INFO L93 Difference]: Finished difference Result 5105 states and 6307 transitions. [2019-11-15 21:14:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:19,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-15 21:14:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:19,930 INFO L225 Difference]: With dead ends: 5105 [2019-11-15 21:14:19,930 INFO L226 Difference]: Without dead ends: 2414 [2019-11-15 21:14:19,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-15 21:14:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2410. [2019-11-15 21:14:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-11-15 21:14:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2692 transitions. [2019-11-15 21:14:19,989 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2692 transitions. Word has length 128 [2019-11-15 21:14:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:19,990 INFO L462 AbstractCegarLoop]: Abstraction has 2410 states and 2692 transitions. [2019-11-15 21:14:19,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2692 transitions. [2019-11-15 21:14:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 21:14:19,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:19,995 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:19,995 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:19,996 INFO L82 PathProgramCache]: Analyzing trace with hash -91008860, now seen corresponding path program 1 times [2019-11-15 21:14:19,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:19,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069874999] [2019-11-15 21:14:19,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:19,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:19,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:14:20,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069874999] [2019-11-15 21:14:20,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:20,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:20,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336599980] [2019-11-15 21:14:20,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:20,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:20,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:20,061 INFO L87 Difference]: Start difference. First operand 2410 states and 2692 transitions. Second operand 4 states. [2019-11-15 21:14:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:20,566 INFO L93 Difference]: Finished difference Result 4526 states and 5047 transitions. [2019-11-15 21:14:20,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:20,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-15 21:14:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:20,581 INFO L225 Difference]: With dead ends: 4526 [2019-11-15 21:14:20,582 INFO L226 Difference]: Without dead ends: 2117 [2019-11-15 21:14:20,585 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-11-15 21:14:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-11-15 21:14:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1557. [2019-11-15 21:14:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-15 21:14:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1702 transitions. [2019-11-15 21:14:20,635 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1702 transitions. Word has length 140 [2019-11-15 21:14:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:20,636 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 1702 transitions. [2019-11-15 21:14:20,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1702 transitions. [2019-11-15 21:14:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 21:14:20,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:20,641 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:20,641 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1260894349, now seen corresponding path program 1 times [2019-11-15 21:14:20,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:20,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210768614] [2019-11-15 21:14:20,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:20,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:20,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:21,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210768614] [2019-11-15 21:14:21,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:21,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:21,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236071953] [2019-11-15 21:14:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:14:21,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:14:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:14:21,113 INFO L87 Difference]: Start difference. First operand 1557 states and 1702 transitions. Second operand 7 states. [2019-11-15 21:14:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:22,252 INFO L93 Difference]: Finished difference Result 3266 states and 3576 transitions. [2019-11-15 21:14:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:22,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-11-15 21:14:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:22,261 INFO L225 Difference]: With dead ends: 3266 [2019-11-15 21:14:22,261 INFO L226 Difference]: Without dead ends: 1571 [2019-11-15 21:14:22,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-11-15 21:14:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1417. [2019-11-15 21:14:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-11-15 21:14:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1553 transitions. [2019-11-15 21:14:22,302 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1553 transitions. Word has length 169 [2019-11-15 21:14:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:22,303 INFO L462 AbstractCegarLoop]: Abstraction has 1417 states and 1553 transitions. [2019-11-15 21:14:22,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:14:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1553 transitions. [2019-11-15 21:14:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 21:14:22,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:22,306 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:22,307 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 992818194, now seen corresponding path program 1 times [2019-11-15 21:14:22,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:22,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432228225] [2019-11-15 21:14:22,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:22,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:22,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:22,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432228225] [2019-11-15 21:14:22,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:22,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:22,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305002433] [2019-11-15 21:14:22,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:22,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:22,464 INFO L87 Difference]: Start difference. First operand 1417 states and 1553 transitions. Second operand 4 states. [2019-11-15 21:14:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:23,138 INFO L93 Difference]: Finished difference Result 2691 states and 2953 transitions. [2019-11-15 21:14:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:23,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 21:14:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:23,144 INFO L225 Difference]: With dead ends: 2691 [2019-11-15 21:14:23,144 INFO L226 Difference]: Without dead ends: 1136 [2019-11-15 21:14:23,146 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-11-15 21:14:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-11-15 21:14:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1135. [2019-11-15 21:14:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-11-15 21:14:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1216 transitions. [2019-11-15 21:14:23,170 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1216 transitions. Word has length 178 [2019-11-15 21:14:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:23,171 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 1216 transitions. [2019-11-15 21:14:23,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1216 transitions. [2019-11-15 21:14:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 21:14:23,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:23,174 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:23,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -751837008, now seen corresponding path program 1 times [2019-11-15 21:14:23,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:23,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811943761] [2019-11-15 21:14:23,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:23,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:23,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 21:14:23,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811943761] [2019-11-15 21:14:23,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:23,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:23,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854223313] [2019-11-15 21:14:23,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:23,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:23,328 INFO L87 Difference]: Start difference. First operand 1135 states and 1216 transitions. Second operand 3 states. [2019-11-15 21:14:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:23,663 INFO L93 Difference]: Finished difference Result 2268 states and 2425 transitions. [2019-11-15 21:14:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:23,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-15 21:14:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:23,664 INFO L225 Difference]: With dead ends: 2268 [2019-11-15 21:14:23,664 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:14:23,666 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-11-15 21:14:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:14:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:14:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:14:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:14:23,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2019-11-15 21:14:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:23,667 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:23,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:14:23,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:14:23,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:14:24,044 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-15 21:14:24,335 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-15 21:14:24,336 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 21:14:24,337 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 21:14:24,338 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,339 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,340 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,340 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 21:14:24,340 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 21:14:24,340 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 21:14:24,341 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 21:14:24,341 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 21:14:24,341 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,342 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 21:14:24,343 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 21:14:24,344 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,345 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,346 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,346 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 21:14:24,346 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,347 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 21:14:24,348 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 21:14:24,349 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 21:14:24,350 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 475) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 21:14:24,351 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= 1 ~a11~0))) (let ((.cse4 (= 10 ~a28~0)) (.cse7 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse0 (not .cse6)) (.cse2 (= ~a17~0 8)) (.cse5 (not .cse3)) (.cse10 (not .cse9)) (.cse8 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse1 .cse4) (and .cse5 .cse6 .cse4 .cse7) (and (and .cse1 .cse7 .cse8) .cse3) (and .cse9 .cse3 .cse7) (and .cse9 .cse2 .cse1) (and .cse2 .cse10 .cse0 .cse8) (and .cse2 .cse5 .cse10 .cse8)))) [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,352 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 21:14:24,353 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,354 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 21:14:24,355 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= 1 ~a11~0))) (let ((.cse4 (= 10 ~a28~0)) (.cse7 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse0 (not .cse6)) (.cse2 (= ~a17~0 8)) (.cse5 (not .cse3)) (.cse10 (not .cse9)) (.cse8 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse1 .cse4) (and .cse5 .cse6 .cse4 .cse7) (and (and .cse1 .cse7 .cse8) .cse3) (and .cse9 .cse3 .cse7) (and .cse9 .cse2 .cse1) (and .cse2 .cse10 .cse0 .cse8) (and .cse2 .cse5 .cse10 .cse8)))) [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 21:14:24,356 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 21:14:24,357 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,358 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 21:14:24,359 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 21:14:24,360 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 21:14:24,361 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 21:14:24,362 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,363 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,364 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 21:14:24,365 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 21:14:24,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:14:24 BoogieIcfgContainer [2019-11-15 21:14:24,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:14:24,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:14:24,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:14:24,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:14:24,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:13" (3/4) ... [2019-11-15 21:14:24,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:14:24,416 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 21:14:24,423 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:14:24,591 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_841452cf-f931-4abd-aea5-1ae213f88c6a/bin/uautomizer/witness.graphml [2019-11-15 21:14:24,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:14:24,592 INFO L168 Benchmark]: Toolchain (without parser) took 12677.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.1 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -245.1 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,593 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:24,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,594 INFO L168 Benchmark]: Boogie Preprocessor took 69.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,594 INFO L168 Benchmark]: RCFGBuilder took 1137.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.8 MB in the end (delta: 115.6 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,595 INFO L168 Benchmark]: TraceAbstraction took 10593.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.1 MB). Free memory was 986.8 MB in the beginning and 1.2 GB in the end (delta: -212.8 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,595 INFO L168 Benchmark]: Witness Printer took 205.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:24,597 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1137.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.8 MB in the end (delta: 115.6 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10593.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.1 MB). Free memory was 986.8 MB in the beginning and 1.2 GB in the end (delta: -212.8 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. * Witness Printer took 205.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 475]: 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: (((((((((!(1 == a11) && a19 == 1) && a17 == 8) && a25 == 1) || (a19 == 1 && 10 == a28)) || (((!(a25 == 1) && 1 == a11) && 10 == a28) && a17 <= 8)) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a19 == 1) && a17 == 8) && a25 == 1) || (a19 == 1 && 10 == a28)) || (((!(a25 == 1) && 1 == a11) && 10 == a28) && a17 <= 8)) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 803 SDtfs, 2334 SDslu, 259 SDs, 0 SdLazy, 5614 SolverSat, 808 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1875 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 35 NumberOfFragments, 209 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1434 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 818 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1268 ConstructedInterpolants, 0 QuantifiedInterpolants, 617302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 420/420 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...