./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:52:57,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:52:57,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:52:57,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:52:57,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:52:57,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:52:57,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:52:57,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:52:57,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:52:57,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:52:57,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:52:57,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:52:57,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:52:57,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:52:57,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:52:57,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:52:57,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:52:57,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:52:57,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:52:57,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:52:57,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:52:57,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:52:57,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:52:57,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:52:57,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:52:57,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:52:57,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:52:57,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:52:57,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:52:57,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:52:57,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:52:57,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:52:57,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:52:57,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:52:57,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:52:57,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:52:57,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:52:57,840 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:52:57,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:52:57,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:52:57,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:52:57,842 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:52:57,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:52:57,843 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:52:57,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:52:57,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:52:57,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:52:57,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:52:57,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:52:57,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:52:57,844 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:52:57,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:52:57,845 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:52:57,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:52:57,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:52:57,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:52:57,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:52:57,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:52:57,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:52:57,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:52:57,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:52:57,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:52:57,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:52:57,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:52:57,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:52:57,848 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-01-12 00:52:57,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:52:57,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:52:57,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:52:57,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:52:57,931 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:52:57,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2019-01-12 00:52:57,990 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5429ab6/6a8cd78fc7c0439c978e20c2ba1769f8/FLAGbf4756951 [2019-01-12 00:52:58,522 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:52:58,523 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2019-01-12 00:52:58,536 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5429ab6/6a8cd78fc7c0439c978e20c2ba1769f8/FLAGbf4756951 [2019-01-12 00:52:58,758 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5429ab6/6a8cd78fc7c0439c978e20c2ba1769f8 [2019-01-12 00:52:58,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:52:58,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:52:58,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:58,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:52:58,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:52:58,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:58" (1/1) ... [2019-01-12 00:52:58,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3351f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:58, skipping insertion in model container [2019-01-12 00:52:58,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:58" (1/1) ... [2019-01-12 00:52:58,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:52:58,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:52:59,344 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:59,355 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:52:59,482 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:59,503 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:52:59,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59 WrapperNode [2019-01-12 00:52:59,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:59,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:59,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:52:59,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:52:59,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:59,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:52:59,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:52:59,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:52:59,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... [2019-01-12 00:52:59,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:52:59,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:52:59,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:52:59,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:52:59,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-12 00:52:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:52:59,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:53:03,055 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:53:03,055 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:53:03,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:03 BoogieIcfgContainer [2019-01-12 00:53:03,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:53:03,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:53:03,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:53:03,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:53:03,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:52:58" (1/3) ... [2019-01-12 00:53:03,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcfecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:03, skipping insertion in model container [2019-01-12 00:53:03,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:59" (2/3) ... [2019-01-12 00:53:03,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcfecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:03, skipping insertion in model container [2019-01-12 00:53:03,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:03" (3/3) ... [2019-01-12 00:53:03,066 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2019-01-12 00:53:03,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:53:03,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:53:03,103 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:53:03,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:53:03,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:53:03,148 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:53:03,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:53:03,149 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:53:03,149 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:53:03,149 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:53:03,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:53:03,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:53:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:53:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 00:53:03,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:03,185 INFO L402 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-01-12 00:53:03,188 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash 620620582, now seen corresponding path program 1 times [2019-01-12 00:53:03,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:03,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:03,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:03,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:03,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:03,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:03,878 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:53:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:06,470 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:53:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:06,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 00:53:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:06,492 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:53:06,492 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:53:06,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:53:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:53:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:53:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-01-12 00:53:06,572 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 101 [2019-01-12 00:53:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:06,574 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-01-12 00:53:06,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-01-12 00:53:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 00:53:06,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:06,580 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:06,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1432944013, now seen corresponding path program 1 times [2019-01-12 00:53:06,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:06,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:06,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:06,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:06,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:06,899 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-01-12 00:53:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:08,237 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-01-12 00:53:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:08,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 00:53:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:08,246 INFO L225 Difference]: With dead ends: 1447 [2019-01-12 00:53:08,247 INFO L226 Difference]: Without dead ends: 1052 [2019-01-12 00:53:08,250 INFO L631 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-01-12 00:53:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-01-12 00:53:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-01-12 00:53:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-12 00:53:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-01-12 00:53:08,304 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 108 [2019-01-12 00:53:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:08,305 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-01-12 00:53:08,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-01-12 00:53:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 00:53:08,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:08,311 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:08,311 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1541134986, now seen corresponding path program 1 times [2019-01-12 00:53:08,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:08,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:08,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:08,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:08,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:08,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:08,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:08,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:08,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:08,409 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-01-12 00:53:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:10,785 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-01-12 00:53:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:10,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-01-12 00:53:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:10,791 INFO L225 Difference]: With dead ends: 1578 [2019-01-12 00:53:10,791 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:53:10,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:53:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:53:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:53:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-01-12 00:53:10,836 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 122 [2019-01-12 00:53:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:10,837 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-01-12 00:53:10,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-01-12 00:53:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 00:53:10,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:10,841 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:10,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1660180891, now seen corresponding path program 1 times [2019-01-12 00:53:10,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:10,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:10,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:10,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:10,944 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-01-12 00:53:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:11,996 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-01-12 00:53:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:11,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-01-12 00:53:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:12,004 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:53:12,004 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:53:12,007 INFO L631 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-01-12 00:53:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:53:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-01-12 00:53:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:53:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1373 transitions. [2019-01-12 00:53:12,040 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1373 transitions. Word has length 123 [2019-01-12 00:53:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:12,041 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1373 transitions. [2019-01-12 00:53:12,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1373 transitions. [2019-01-12 00:53:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-12 00:53:12,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:12,045 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:12,046 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:12,046 INFO L82 PathProgramCache]: Analyzing trace with hash -767786909, now seen corresponding path program 1 times [2019-01-12 00:53:12,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:12,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:12,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:53:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:12,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:12,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:12,190 INFO L87 Difference]: Start difference. First operand 1183 states and 1373 transitions. Second operand 3 states. [2019-01-12 00:53:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:12,766 INFO L93 Difference]: Finished difference Result 3150 states and 3672 transitions. [2019-01-12 00:53:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:12,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-01-12 00:53:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:12,776 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:53:12,776 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:53:12,779 INFO L631 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-01-12 00:53:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:53:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-01-12 00:53:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-01-12 00:53:12,814 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 127 [2019-01-12 00:53:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:12,815 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-01-12 00:53:12,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-01-12 00:53:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 00:53:12,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:12,820 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-01-12 00:53:12,820 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1109954633, now seen corresponding path program 1 times [2019-01-12 00:53:12,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:12,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:12,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:12,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:53:12,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:12,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:12,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:12,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:12,933 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-01-12 00:53:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:13,871 INFO L93 Difference]: Finished difference Result 3281 states and 3832 transitions. [2019-01-12 00:53:13,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:13,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-01-12 00:53:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:13,879 INFO L225 Difference]: With dead ends: 3281 [2019-01-12 00:53:13,879 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:53:13,883 INFO L631 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-01-12 00:53:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:53:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-01-12 00:53:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-01-12 00:53:13,915 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 129 [2019-01-12 00:53:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:13,915 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-01-12 00:53:13,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-01-12 00:53:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-12 00:53:13,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:13,920 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:13,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1564517898, now seen corresponding path program 1 times [2019-01-12 00:53:13,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:13,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:14,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:14,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:14,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:14,086 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-01-12 00:53:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:15,285 INFO L93 Difference]: Finished difference Result 3543 states and 4110 transitions. [2019-01-12 00:53:15,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:15,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-01-12 00:53:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:15,294 INFO L225 Difference]: With dead ends: 3543 [2019-01-12 00:53:15,294 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:53:15,297 INFO L631 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-01-12 00:53:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:53:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-01-12 00:53:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2124 transitions. [2019-01-12 00:53:15,337 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2124 transitions. Word has length 130 [2019-01-12 00:53:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:15,337 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2124 transitions. [2019-01-12 00:53:15,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2124 transitions. [2019-01-12 00:53:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-12 00:53:15,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:15,343 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:15,343 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1099746882, now seen corresponding path program 1 times [2019-01-12 00:53:15,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:15,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:15,861 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 00:53:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:15,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:15,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:53:15,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:53:15,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:53:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:53:15,944 INFO L87 Difference]: Start difference. First operand 1838 states and 2124 transitions. Second operand 8 states. [2019-01-12 00:53:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:17,509 INFO L93 Difference]: Finished difference Result 3847 states and 4438 transitions. [2019-01-12 00:53:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:53:17,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-01-12 00:53:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:17,520 INFO L225 Difference]: With dead ends: 3847 [2019-01-12 00:53:17,520 INFO L226 Difference]: Without dead ends: 2142 [2019-01-12 00:53:17,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:53:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-01-12 00:53:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-01-12 00:53:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2112 transitions. [2019-01-12 00:53:17,565 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2112 transitions. Word has length 134 [2019-01-12 00:53:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:17,565 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2112 transitions. [2019-01-12 00:53:17,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:53:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2112 transitions. [2019-01-12 00:53:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 00:53:17,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:17,571 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:17,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853781, now seen corresponding path program 1 times [2019-01-12 00:53:17,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:17,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-12 00:53:17,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:17,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:17,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:17,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:17,656 INFO L87 Difference]: Start difference. First operand 1838 states and 2112 transitions. Second operand 3 states. [2019-01-12 00:53:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:18,479 INFO L93 Difference]: Finished difference Result 3674 states and 4220 transitions. [2019-01-12 00:53:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:18,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-01-12 00:53:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:18,488 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:53:18,489 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:53:18,492 INFO L631 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-01-12 00:53:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:53:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-01-12 00:53:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2019-01-12 00:53:18,530 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 157 [2019-01-12 00:53:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:18,530 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2019-01-12 00:53:18,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2019-01-12 00:53:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 00:53:18,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:18,537 INFO L402 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, 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] [2019-01-12 00:53:18,538 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash -221184622, now seen corresponding path program 1 times [2019-01-12 00:53:18,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:18,998 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 00:53:19,179 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 00:53:19,743 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-12 00:53:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 00:53:20,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 00:53:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 00:53:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-01-12 00:53:20,013 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand 13 states. [2019-01-12 00:53:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:24,049 INFO L93 Difference]: Finished difference Result 3732 states and 4088 transitions. [2019-01-12 00:53:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 00:53:24,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-01-12 00:53:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:24,059 INFO L225 Difference]: With dead ends: 3732 [2019-01-12 00:53:24,059 INFO L226 Difference]: Without dead ends: 2027 [2019-01-12 00:53:24,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-01-12 00:53:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-01-12 00:53:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1765. [2019-01-12 00:53:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-01-12 00:53:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1916 transitions. [2019-01-12 00:53:24,095 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1916 transitions. Word has length 167 [2019-01-12 00:53:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:24,095 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 1916 transitions. [2019-01-12 00:53:24,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 00:53:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1916 transitions. [2019-01-12 00:53:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-12 00:53:24,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:24,102 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:24,102 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1527065083, now seen corresponding path program 1 times [2019-01-12 00:53:24,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:24,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:24,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:24,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 00:53:24,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:24,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:24,306 INFO L87 Difference]: Start difference. First operand 1765 states and 1916 transitions. Second operand 3 states. [2019-01-12 00:53:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:24,945 INFO L93 Difference]: Finished difference Result 3528 states and 3830 transitions. [2019-01-12 00:53:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:24,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-01-12 00:53:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:24,951 INFO L225 Difference]: With dead ends: 3528 [2019-01-12 00:53:24,952 INFO L226 Difference]: Without dead ends: 1765 [2019-01-12 00:53:24,953 INFO L631 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-01-12 00:53:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-01-12 00:53:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-01-12 00:53:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-01-12 00:53:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1762 transitions. [2019-01-12 00:53:24,980 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1762 transitions. Word has length 195 [2019-01-12 00:53:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:24,980 INFO L480 AbstractCegarLoop]: Abstraction has 1634 states and 1762 transitions. [2019-01-12 00:53:24,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1762 transitions. [2019-01-12 00:53:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-01-12 00:53:24,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:24,987 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:24,987 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:24,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash 792554223, now seen corresponding path program 1 times [2019-01-12 00:53:24,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:24,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:24,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-01-12 00:53:25,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:25,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 00:53:25,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 00:53:25,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 00:53:25,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:53:25,242 INFO L87 Difference]: Start difference. First operand 1634 states and 1762 transitions. Second operand 6 states. [2019-01-12 00:53:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:26,371 INFO L93 Difference]: Finished difference Result 3423 states and 3704 transitions. [2019-01-12 00:53:26,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:26,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-01-12 00:53:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:26,379 INFO L225 Difference]: With dead ends: 3423 [2019-01-12 00:53:26,379 INFO L226 Difference]: Without dead ends: 1922 [2019-01-12 00:53:26,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:53:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-01-12 00:53:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1896. [2019-01-12 00:53:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-01-12 00:53:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2020 transitions. [2019-01-12 00:53:26,423 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2020 transitions. Word has length 239 [2019-01-12 00:53:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:26,423 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2020 transitions. [2019-01-12 00:53:26,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 00:53:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2020 transitions. [2019-01-12 00:53:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-01-12 00:53:26,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:26,432 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:53:26,432 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1426430283, now seen corresponding path program 1 times [2019-01-12 00:53:26,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:26,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-12 00:53:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:26,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:53:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:53:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:26,665 INFO L87 Difference]: Start difference. First operand 1896 states and 2020 transitions. Second operand 5 states. [2019-01-12 00:53:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:27,619 INFO L93 Difference]: Finished difference Result 3790 states and 4036 transitions. [2019-01-12 00:53:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:27,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-01-12 00:53:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:27,626 INFO L225 Difference]: With dead ends: 3790 [2019-01-12 00:53:27,627 INFO L226 Difference]: Without dead ends: 1765 [2019-01-12 00:53:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-01-12 00:53:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-01-12 00:53:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-01-12 00:53:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1882 transitions. [2019-01-12 00:53:27,658 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1882 transitions. Word has length 262 [2019-01-12 00:53:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 1882 transitions. [2019-01-12 00:53:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:53:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1882 transitions. [2019-01-12 00:53:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-01-12 00:53:27,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:27,665 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:53:27,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -42906621, now seen corresponding path program 1 times [2019-01-12 00:53:27,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:27,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-01-12 00:53:28,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:28,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 00:53:28,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 00:53:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 00:53:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:53:28,098 INFO L87 Difference]: Start difference. First operand 1765 states and 1882 transitions. Second operand 6 states. [2019-01-12 00:53:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:28,923 INFO L93 Difference]: Finished difference Result 3467 states and 3713 transitions. [2019-01-12 00:53:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:28,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-01-12 00:53:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:28,925 INFO L225 Difference]: With dead ends: 3467 [2019-01-12 00:53:28,925 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:28,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:53:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:28,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-01-12 00:53:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:28,929 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:28,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 00:53:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:28,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:28,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:28,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:29,048 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 74 [2019-01-12 00:53:29,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:29,994 WARN L181 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-01-12 00:53:30,312 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-01-12 00:53:30,316 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:30,316 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:30,317 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:30,318 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:30,318 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,321 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:30,322 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:30,323 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:30,327 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:30,327 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:30,327 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:30,327 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,327 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:30,328 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:30,329 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:30,329 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:30,329 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a8~0 15))) (let ((.cse3 (not .cse9)) (.cse7 (= ~a21~0 1)) (.cse2 (= ~a7~0 1))) (let ((.cse1 (= ~a20~0 1)) (.cse10 (= ~a16~0 5)) (.cse11 (not .cse2)) (.cse4 (= ~a12~0 8)) (.cse6 (<= ~a17~0 0)) (.cse8 (<= ~a20~0 0)) (.cse12 (= ~a17~0 1)) (.cse0 (and .cse3 .cse7)) (.cse5 (= ~a16~0 4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and (or (= 3 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse5 .cse4 .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse7 .cse10) (and .cse11 .cse4 .cse7 .cse1) (and .cse11 .cse9 .cse4 .cse7 (not .cse5)) (and (and .cse3 .cse10) (not (= ~a8~0 13))) (and .cse11 .cse12 .cse4 .cse7) (and .cse2 .cse5 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse12) (and .cse0 .cse5))))) [2019-01-12 00:53:30,329 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,330 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,330 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:30,333 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,334 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,335 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:30,338 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:30,339 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:30,340 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:30,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a8~0 15))) (let ((.cse3 (not .cse9)) (.cse7 (= ~a21~0 1)) (.cse2 (= ~a7~0 1))) (let ((.cse1 (= ~a20~0 1)) (.cse10 (= ~a16~0 5)) (.cse11 (not .cse2)) (.cse4 (= ~a12~0 8)) (.cse6 (<= ~a17~0 0)) (.cse8 (<= ~a20~0 0)) (.cse12 (= ~a17~0 1)) (.cse0 (and .cse3 .cse7)) (.cse5 (= ~a16~0 4))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and (or (= 3 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse5 .cse4 .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse7 .cse10) (and .cse11 .cse4 .cse7 .cse1) (and .cse11 .cse9 .cse4 .cse7 (not .cse5)) (and (and .cse3 .cse10) (not (= ~a8~0 13))) (and .cse11 .cse12 .cse4 .cse7) (and .cse2 .cse5 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse12) (and .cse0 .cse5))))) [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,343 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,344 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,345 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,345 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:30,351 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:30,352 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:30,353 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:30,354 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:30,355 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:30,356 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:30,358 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:30,359 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:30,359 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:30,359 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:30,359 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:30,359 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:30,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:30 BoogieIcfgContainer [2019-01-12 00:53:30,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:30,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:30,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:30,407 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:30,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:03" (3/4) ... [2019-01-12 00:53:30,412 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:30,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:30,437 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:30,607 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:30,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:30,608 INFO L168 Benchmark]: Toolchain (without parser) took 31845.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.6 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -320.6 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,610 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:53:30,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.38 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.1 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,611 INFO L168 Benchmark]: Boogie Preprocessor took 117.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,614 INFO L168 Benchmark]: RCFGBuilder took 3258.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 939.3 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,614 INFO L168 Benchmark]: TraceAbstraction took 27347.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -342.4 MB). Peak memory consumption was 468.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,616 INFO L168 Benchmark]: Witness Printer took 202.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:30,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.38 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.1 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3258.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 939.3 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27347.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -342.4 MB). Peak memory consumption was 468.9 MB. Max. memory is 11.5 GB. * Witness Printer took 202.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(a8 == 15) && a21 == 1) && a20 == 1) || ((a7 == 1 && !(a8 == 15)) && a12 == 8)) || ((((((((((3 == input || input == 2) || input == 4) || 1 == input) || 5 == input) || input == 6) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a8 == 15 && a12 == 8) && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && !(a16 == 4))) || ((!(a8 == 15) && a16 == 5) && !(a8 == 13))) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((!(a8 == 15) && a21 == 1) && a17 == 1)) || ((!(a8 == 15) && a21 == 1) && a16 == 4) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((!(a8 == 15) && a21 == 1) && a20 == 1) || ((a7 == 1 && !(a8 == 15)) && a12 == 8)) || ((((((((((3 == input || input == 2) || input == 4) || 1 == input) || 5 == input) || input == 6) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a8 == 15 && a12 == 8) && a21 == 1) && a16 == 5)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && !(a16 == 4))) || ((!(a8 == 15) && a16 == 5) && !(a8 == 13))) || (((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((!(a8 == 15) && a21 == 1) && a17 == 1)) || ((!(a8 == 15) && a21 == 1) && a16 == 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 27.2s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 799 SDtfs, 3379 SDslu, 175 SDs, 0 SdLazy, 8117 SolverSat, 1000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 349 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16296 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 932 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...