java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:09,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:09,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:09,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:09,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:09,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:10,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:10,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:10,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:10,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:10,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:10,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:10,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:10,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:10,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:10,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:10,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:10,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:10,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:10,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:10,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:10,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:10,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:10,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:10,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:10,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:10,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:10,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:10,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:10,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:10,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:10,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:10,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:10,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:10,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:10,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:10,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:50:10,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:10,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:10,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:10,084 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:10,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:10,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:10,085 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:10,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:10,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:10,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:10,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:10,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:10,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:10,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:10,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:10,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:10,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:10,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:10,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:10,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:10,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:10,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:10,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:10,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:10,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:10,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:10,090 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:10,090 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:10,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:10,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:10,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:10,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:10,163 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:10,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-24 14:50:10,226 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/407f91b22/b865b3592061447c86e90e315939de2d/FLAG08f3f5ee0 [2018-10-24 14:50:10,838 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:10,842 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-24 14:50:10,860 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/407f91b22/b865b3592061447c86e90e315939de2d/FLAG08f3f5ee0 [2018-10-24 14:50:10,874 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/407f91b22/b865b3592061447c86e90e315939de2d [2018-10-24 14:50:10,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:10,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:10,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:10,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:10,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:10,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:10" (1/1) ... [2018-10-24 14:50:10,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e269b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:10, skipping insertion in model container [2018-10-24 14:50:10,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:10" (1/1) ... [2018-10-24 14:50:10,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:10,967 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:11,421 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:11,427 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:11,539 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:11,557 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:11,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11 WrapperNode [2018-10-24 14:50:11,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:11,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:11,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:11,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:11,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:11,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:11,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:11,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:11,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... [2018-10-24 14:50:11,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:11,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:11,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:11,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:11,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:50:11,897 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:11,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:11,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:14,934 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:14,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:14 BoogieIcfgContainer [2018-10-24 14:50:14,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:14,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:14,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:14,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:14,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:10" (1/3) ... [2018-10-24 14:50:14,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bb2fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:14, skipping insertion in model container [2018-10-24 14:50:14,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:11" (2/3) ... [2018-10-24 14:50:14,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bb2fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:14, skipping insertion in model container [2018-10-24 14:50:14,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:14" (3/3) ... [2018-10-24 14:50:14,945 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-10-24 14:50:14,958 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:14,971 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:14,991 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:15,042 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:15,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:15,043 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:15,043 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:15,043 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:15,043 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:15,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:15,044 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:15,044 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 14:50:15,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:15,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:15,087 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:15,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 782686367, now seen corresponding path program 1 times [2018-10-24 14:50:15,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:15,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:15,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:15,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:15,778 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 14:50:16,248 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-24 14:50:16,405 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-10-24 14:50:16,564 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-24 14:50:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:16,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:16,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-24 14:50:16,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:50:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:50:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:50:17,016 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-10-24 14:50:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:19,843 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-10-24 14:50:19,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:50:19,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-10-24 14:50:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:19,863 INFO L225 Difference]: With dead ends: 636 [2018-10-24 14:50:19,863 INFO L226 Difference]: Without dead ends: 254 [2018-10-24 14:50:19,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-24 14:50:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-24 14:50:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-10-24 14:50:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-24 14:50:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-10-24 14:50:19,923 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 132 [2018-10-24 14:50:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:19,925 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-10-24 14:50:19,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 14:50:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-10-24 14:50:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 14:50:19,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:19,932 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:19,933 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:19,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2122611721, now seen corresponding path program 1 times [2018-10-24 14:50:19,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:19,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:19,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:50:20,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:20,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:20,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:20,149 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 3 states. [2018-10-24 14:50:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:21,258 INFO L93 Difference]: Finished difference Result 579 states and 960 transitions. [2018-10-24 14:50:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:21,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-10-24 14:50:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:21,265 INFO L225 Difference]: With dead ends: 579 [2018-10-24 14:50:21,265 INFO L226 Difference]: Without dead ends: 386 [2018-10-24 14:50:21,267 INFO L605 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 [2018-10-24 14:50:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-24 14:50:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-10-24 14:50:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-24 14:50:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2018-10-24 14:50:21,292 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 137 [2018-10-24 14:50:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:21,293 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2018-10-24 14:50:21,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2018-10-24 14:50:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-24 14:50:21,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:21,299 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:21,299 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:21,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 146041456, now seen corresponding path program 1 times [2018-10-24 14:50:21,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:21,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:50:21,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:21,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:21,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:21,456 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand 4 states. [2018-10-24 14:50:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:22,883 INFO L93 Difference]: Finished difference Result 975 states and 1590 transitions. [2018-10-24 14:50:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:22,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-10-24 14:50:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:22,889 INFO L225 Difference]: With dead ends: 975 [2018-10-24 14:50:22,889 INFO L226 Difference]: Without dead ends: 650 [2018-10-24 14:50:22,891 INFO L605 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 [2018-10-24 14:50:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-24 14:50:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2018-10-24 14:50:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-24 14:50:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 954 transitions. [2018-10-24 14:50:22,919 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 954 transitions. Word has length 143 [2018-10-24 14:50:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:22,919 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 954 transitions. [2018-10-24 14:50:22,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 954 transitions. [2018-10-24 14:50:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 14:50:22,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:22,922 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:22,922 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:22,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1898708700, now seen corresponding path program 1 times [2018-10-24 14:50:22,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:50:23,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:23,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:23,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:23,081 INFO L87 Difference]: Start difference. First operand 650 states and 954 transitions. Second operand 3 states. [2018-10-24 14:50:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:25,340 INFO L93 Difference]: Finished difference Result 1371 states and 2052 transitions. [2018-10-24 14:50:25,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:25,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-24 14:50:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:25,346 INFO L225 Difference]: With dead ends: 1371 [2018-10-24 14:50:25,346 INFO L226 Difference]: Without dead ends: 782 [2018-10-24 14:50:25,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-24 14:50:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2018-10-24 14:50:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-10-24 14:50:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1134 transitions. [2018-10-24 14:50:25,378 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1134 transitions. Word has length 151 [2018-10-24 14:50:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:25,379 INFO L481 AbstractCegarLoop]: Abstraction has 782 states and 1134 transitions. [2018-10-24 14:50:25,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1134 transitions. [2018-10-24 14:50:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-24 14:50:25,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:25,383 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:25,383 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:25,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1347151541, now seen corresponding path program 1 times [2018-10-24 14:50:25,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:50:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:25,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:25,647 INFO L87 Difference]: Start difference. First operand 782 states and 1134 transitions. Second operand 4 states. [2018-10-24 14:50:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:27,167 INFO L93 Difference]: Finished difference Result 2691 states and 4008 transitions. [2018-10-24 14:50:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:27,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-10-24 14:50:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:27,179 INFO L225 Difference]: With dead ends: 2691 [2018-10-24 14:50:27,180 INFO L226 Difference]: Without dead ends: 1970 [2018-10-24 14:50:27,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-10-24 14:50:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-10-24 14:50:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-10-24 14:50:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2683 transitions. [2018-10-24 14:50:27,221 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2683 transitions. Word has length 161 [2018-10-24 14:50:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:27,221 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 2683 transitions. [2018-10-24 14:50:27,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2683 transitions. [2018-10-24 14:50:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 14:50:27,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:27,227 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:27,228 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:27,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:27,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1183098076, now seen corresponding path program 1 times [2018-10-24 14:50:27,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:27,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:27,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:50:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:27,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:27,324 INFO L87 Difference]: Start difference. First operand 1970 states and 2683 transitions. Second operand 4 states. [2018-10-24 14:50:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:28,332 INFO L93 Difference]: Finished difference Result 3879 states and 5300 transitions. [2018-10-24 14:50:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:28,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-10-24 14:50:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:28,345 INFO L225 Difference]: With dead ends: 3879 [2018-10-24 14:50:28,345 INFO L226 Difference]: Without dead ends: 1970 [2018-10-24 14:50:28,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-10-24 14:50:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-10-24 14:50:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-10-24 14:50:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2659 transitions. [2018-10-24 14:50:28,393 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2659 transitions. Word has length 167 [2018-10-24 14:50:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:28,393 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 2659 transitions. [2018-10-24 14:50:28,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2659 transitions. [2018-10-24 14:50:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 14:50:28,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:28,400 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:28,400 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:28,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1439669736, now seen corresponding path program 1 times [2018-10-24 14:50:28,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:28,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:28,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:28,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:50:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:28,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:28,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:28,529 INFO L87 Difference]: Start difference. First operand 1970 states and 2659 transitions. Second operand 3 states. [2018-10-24 14:50:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:29,540 INFO L93 Difference]: Finished difference Result 5327 states and 7170 transitions. [2018-10-24 14:50:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:29,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-10-24 14:50:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:29,556 INFO L225 Difference]: With dead ends: 5327 [2018-10-24 14:50:29,556 INFO L226 Difference]: Without dead ends: 2475 [2018-10-24 14:50:29,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2018-10-24 14:50:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2018-10-24 14:50:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-24 14:50:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2886 transitions. [2018-10-24 14:50:29,609 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2886 transitions. Word has length 170 [2018-10-24 14:50:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:29,610 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2886 transitions. [2018-10-24 14:50:29,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2886 transitions. [2018-10-24 14:50:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 14:50:29,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:29,616 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:29,616 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:29,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1304267757, now seen corresponding path program 1 times [2018-10-24 14:50:29,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:29,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:30,060 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:50:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:30,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:30,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:30,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:50:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:50:30,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:30,088 INFO L87 Difference]: Start difference. First operand 2475 states and 2886 transitions. Second operand 5 states. [2018-10-24 14:50:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:33,326 INFO L93 Difference]: Finished difference Result 7536 states and 8885 transitions. [2018-10-24 14:50:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:33,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-10-24 14:50:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:33,341 INFO L225 Difference]: With dead ends: 7536 [2018-10-24 14:50:33,341 INFO L226 Difference]: Without dead ends: 4590 [2018-10-24 14:50:33,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2018-10-24 14:50:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3657. [2018-10-24 14:50:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-10-24 14:50:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4125 transitions. [2018-10-24 14:50:33,408 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4125 transitions. Word has length 184 [2018-10-24 14:50:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:33,409 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 4125 transitions. [2018-10-24 14:50:33,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:50:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4125 transitions. [2018-10-24 14:50:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-24 14:50:33,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:33,416 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:33,417 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:33,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1770574550, now seen corresponding path program 1 times [2018-10-24 14:50:33,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:33,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:33,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:33,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:33,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 14:50:33,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:33,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:33,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:33,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:33,627 INFO L87 Difference]: Start difference. First operand 3657 states and 4125 transitions. Second operand 4 states. [2018-10-24 14:50:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:35,479 INFO L93 Difference]: Finished difference Result 7787 states and 8844 transitions. [2018-10-24 14:50:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:35,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-10-24 14:50:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:35,492 INFO L225 Difference]: With dead ends: 7787 [2018-10-24 14:50:35,492 INFO L226 Difference]: Without dead ends: 3925 [2018-10-24 14:50:35,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-10-24 14:50:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3923. [2018-10-24 14:50:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2018-10-24 14:50:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 4270 transitions. [2018-10-24 14:50:35,559 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 4270 transitions. Word has length 214 [2018-10-24 14:50:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:35,560 INFO L481 AbstractCegarLoop]: Abstraction has 3923 states and 4270 transitions. [2018-10-24 14:50:35,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 4270 transitions. [2018-10-24 14:50:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-24 14:50:35,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:35,568 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:35,569 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:35,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash 488468739, now seen corresponding path program 1 times [2018-10-24 14:50:35,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:35,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 14:50:35,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:35,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:35,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:35,799 INFO L87 Difference]: Start difference. First operand 3923 states and 4270 transitions. Second operand 3 states. [2018-10-24 14:50:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:36,578 INFO L93 Difference]: Finished difference Result 7649 states and 8332 transitions. [2018-10-24 14:50:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:36,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-24 14:50:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:36,599 INFO L225 Difference]: With dead ends: 7649 [2018-10-24 14:50:36,600 INFO L226 Difference]: Without dead ends: 3385 [2018-10-24 14:50:36,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2018-10-24 14:50:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2018-10-24 14:50:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:50:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3617 transitions. [2018-10-24 14:50:36,656 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3617 transitions. Word has length 239 [2018-10-24 14:50:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:36,656 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 3617 transitions. [2018-10-24 14:50:36,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3617 transitions. [2018-10-24 14:50:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-24 14:50:36,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:36,665 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:36,665 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:36,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1228233012, now seen corresponding path program 1 times [2018-10-24 14:50:36,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:36,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 14:50:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:36,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:36,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:36,911 INFO L87 Difference]: Start difference. First operand 3385 states and 3617 transitions. Second operand 4 states. [2018-10-24 14:50:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:37,820 INFO L93 Difference]: Finished difference Result 6576 states and 7029 transitions. [2018-10-24 14:50:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:37,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-24 14:50:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:37,827 INFO L225 Difference]: With dead ends: 6576 [2018-10-24 14:50:37,827 INFO L226 Difference]: Without dead ends: 2058 [2018-10-24 14:50:37,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-10-24 14:50:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2018-10-24 14:50:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2018-10-24 14:50:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2153 transitions. [2018-10-24 14:50:37,861 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2153 transitions. Word has length 242 [2018-10-24 14:50:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:37,862 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 2153 transitions. [2018-10-24 14:50:37,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2153 transitions. [2018-10-24 14:50:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 14:50:37,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:37,868 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:37,868 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1100970507, now seen corresponding path program 1 times [2018-10-24 14:50:37,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:38,378 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 14:50:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-24 14:50:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:38,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:38,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:50:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:50:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:38,653 INFO L87 Difference]: Start difference. First operand 2058 states and 2153 transitions. Second operand 5 states. [2018-10-24 14:50:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:39,802 INFO L93 Difference]: Finished difference Result 4320 states and 4530 transitions. [2018-10-24 14:50:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:39,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-10-24 14:50:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:39,811 INFO L225 Difference]: With dead ends: 4320 [2018-10-24 14:50:39,811 INFO L226 Difference]: Without dead ends: 2057 [2018-10-24 14:50:39,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-10-24 14:50:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2057. [2018-10-24 14:50:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-10-24 14:50:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2147 transitions. [2018-10-24 14:50:39,840 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2147 transitions. Word has length 264 [2018-10-24 14:50:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:39,841 INFO L481 AbstractCegarLoop]: Abstraction has 2057 states and 2147 transitions. [2018-10-24 14:50:39,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:50:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2147 transitions. [2018-10-24 14:50:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-24 14:50:39,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:39,847 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:39,848 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:39,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1163586335, now seen corresponding path program 1 times [2018-10-24 14:50:39,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:39,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:39,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:40,382 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:50:40,693 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-24 14:50:41,007 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-10-24 14:50:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 14:50:41,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:50:41,470 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:50:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:41,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:50:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 14:50:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:50:41,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:50:41,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:50:41,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:50:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:50:41,799 INFO L87 Difference]: Start difference. First operand 2057 states and 2147 transitions. Second operand 14 states. [2018-10-24 14:50:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:46,092 INFO L93 Difference]: Finished difference Result 4113 states and 4298 transitions. [2018-10-24 14:50:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:50:46,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-10-24 14:50:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:46,100 INFO L225 Difference]: With dead ends: 4113 [2018-10-24 14:50:46,100 INFO L226 Difference]: Without dead ends: 2117 [2018-10-24 14:50:46,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-24 14:50:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2018-10-24 14:50:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2018-10-24 14:50:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-10-24 14:50:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2209 transitions. [2018-10-24 14:50:46,139 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2209 transitions. Word has length 288 [2018-10-24 14:50:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:46,139 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 2209 transitions. [2018-10-24 14:50:46,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:50:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2209 transitions. [2018-10-24 14:50:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-24 14:50:46,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:46,146 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:46,147 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:46,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash 470577499, now seen corresponding path program 1 times [2018-10-24 14:50:46,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:46,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:46,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:46,615 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 14:50:46,807 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-10-24 14:50:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-24 14:50:46,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:46,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:50:46,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:50:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:50:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:46,936 INFO L87 Difference]: Start difference. First operand 2117 states and 2209 transitions. Second operand 5 states. [2018-10-24 14:50:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:47,590 INFO L93 Difference]: Finished difference Result 4038 states and 4216 transitions. [2018-10-24 14:50:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:47,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-10-24 14:50:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:47,591 INFO L225 Difference]: With dead ends: 4038 [2018-10-24 14:50:47,591 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:50:47,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:50:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:50:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:50:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:50:47,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 300 [2018-10-24 14:50:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:47,595 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:50:47,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:50:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:50:47,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:50:47,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:50:48,539 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-24 14:50:49,218 WARN L179 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:50:49,223 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,224 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:50:49,225 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,226 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:50:49,227 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:50:49,229 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:50:49,230 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,231 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,232 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:50:49,233 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:50:49,234 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:50:49,235 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,236 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:50:49,237 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,238 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:50:49,239 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:50:49,240 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,241 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:50:49,242 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:50:49,243 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:50:49,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:50:49 BoogieIcfgContainer [2018-10-24 14:50:49,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:50:49,269 INFO L168 Benchmark]: Toolchain (without parser) took 38384.38 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -384.0 MB). Peak memory consumption was 798.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:49,270 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:49,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:49,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 181.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:49,272 INFO L168 Benchmark]: Boogie Preprocessor took 93.21 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:50:49,272 INFO L168 Benchmark]: RCFGBuilder took 3102.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.6 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:49,273 INFO L168 Benchmark]: TraceAbstraction took 34331.22 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 457.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 272.8 MB). Peak memory consumption was 730.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:50:49,278 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 181.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.21 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3102.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.6 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34331.22 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 457.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 272.8 MB). Peak memory consumption was 730.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 34.2s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1782 SDtfs, 4244 SDslu, 912 SDs, 0 SdLazy, 10260 SolverSat, 1338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 309 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3923occurred in iteration=9, 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, 935 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 543 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3065 ConstructedInterpolants, 0 QuantifiedInterpolants, 3378562 SizeOfPredicates, 1 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1994/1999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...